/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:02:35,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:02:35,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:02:35,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:02:35,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:02:35,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:02:35,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:02:35,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:02:35,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:02:35,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:02:35,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:02:35,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:02:35,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:02:35,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:02:35,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:02:35,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:02:35,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:02:35,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:02:35,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:02:35,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:02:35,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:02:35,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:02:35,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:02:35,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:02:35,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:02:35,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:02:35,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:02:35,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:02:35,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:02:35,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:02:35,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:02:35,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:02:35,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:02:35,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:02:35,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:02:35,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:02:35,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:02:35,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:02:35,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:02:35,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:02:35,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:02:35,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:02:35,406 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:02:35,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:02:35,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:02:35,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:02:35,412 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:02:35,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:02:35,413 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:02:35,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:02:35,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:02:35,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:02:35,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:02:35,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:02:35,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:02:35,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:02:35,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:02:35,414 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:02:35,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:02:35,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:02:35,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:02:35,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:02:35,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:02:35,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:02:35,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:02:35,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:02:35,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:02:35,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:02:35,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:02:35,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:02:35,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:02:35,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:02:35,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:02:35,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:02:35,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:02:35,746 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:02:35,747 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-18 18:02:35,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc17216a6/bf62aa19f03948eb8fa4620a4f274f66/FLAG8bc185c2e [2019-12-18 18:02:36,424 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:02:36,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-18 18:02:36,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc17216a6/bf62aa19f03948eb8fa4620a4f274f66/FLAG8bc185c2e [2019-12-18 18:02:36,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc17216a6/bf62aa19f03948eb8fa4620a4f274f66 [2019-12-18 18:02:36,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:02:36,658 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:02:36,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:36,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:02:36,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:02:36,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:36" (1/1) ... [2019-12-18 18:02:36,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3002c0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:36, skipping insertion in model container [2019-12-18 18:02:36,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:36" (1/1) ... [2019-12-18 18:02:36,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:02:36,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:02:37,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:37,368 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:02:37,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:37,540 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:02:37,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37 WrapperNode [2019-12-18 18:02:37,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:37,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:37,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:02:37,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:02:37,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:37,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:02:37,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:02:37,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:02:37,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (1/1) ... [2019-12-18 18:02:37,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:02:37,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:02:37,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:02:37,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:02:37,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02: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-12-18 18:02:37,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:02:37,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:02:37,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:02:37,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:02:37,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:02:37,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:02:37,739 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:02:37,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:02:37,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:02:37,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:02:37,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:02:37,742 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:02:38,835 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:02:38,836 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:02:38,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:38 BoogieIcfgContainer [2019-12-18 18:02:38,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:02:38,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:02:38,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:02:38,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:02:38,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:02:36" (1/3) ... [2019-12-18 18:02:38,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1d4043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:38, skipping insertion in model container [2019-12-18 18:02:38,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:37" (2/3) ... [2019-12-18 18:02:38,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1d4043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:38, skipping insertion in model container [2019-12-18 18:02:38,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:38" (3/3) ... [2019-12-18 18:02:38,851 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2019-12-18 18:02:38,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:02:38,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:02:38,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:02:38,876 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:02:38,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:38,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,050 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,060 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,062 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:39,080 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:02:39,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:02:39,098 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:02:39,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:02:39,098 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:02:39,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:02:39,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:02:39,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:02:39,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:02:39,117 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 18:02:39,119 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 18:02:39,264 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 18:02:39,265 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:39,319 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 18:02:39,442 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 18:02:39,546 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 18:02:39,546 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:39,567 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 18:02:39,620 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 18:02:39,621 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:02:47,466 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 18:02:47,579 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 18:02:47,695 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-18 18:02:47,695 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-18 18:02:47,699 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-18 18:03:01,924 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-18 18:03:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-18 18:03:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:03:01,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:01,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:03:01,932 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-18 18:03:01,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:01,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978558586] [2019-12-18 18:03:01,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:02,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978558586] [2019-12-18 18:03:02,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:02,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:03:02,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283212174] [2019-12-18 18:03:02,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:03:02,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:02,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:03:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:03:02,274 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-18 18:03:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:03,774 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-18 18:03:03,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:03:03,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:03:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:04,506 INFO L225 Difference]: With dead ends: 116456 [2019-12-18 18:03:04,506 INFO L226 Difference]: Without dead ends: 114036 [2019-12-18 18:03:04,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-18 18:03:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-18 18:03:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-18 18:03:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-18 18:03:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-18 18:03:15,957 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-18 18:03:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:15,957 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-18 18:03:15,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:03:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-18 18:03:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:03:15,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:15,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:15,962 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-18 18:03:15,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:15,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52901136] [2019-12-18 18:03:15,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:16,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52901136] [2019-12-18 18:03:16,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:16,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:03:16,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192590947] [2019-12-18 18:03:16,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:16,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:16,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:16,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:16,095 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-18 18:03:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:21,091 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-18 18:03:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:03:21,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:03:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:21,974 INFO L225 Difference]: With dead ends: 152998 [2019-12-18 18:03:21,974 INFO L226 Difference]: Without dead ends: 152998 [2019-12-18 18:03:21,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-18 18:03:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-18 18:03:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-18 18:03:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-18 18:03:33,321 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-18 18:03:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:33,321 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-18 18:03:33,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-18 18:03:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:03:33,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:33,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:33,324 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:33,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-18 18:03:33,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:33,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413812255] [2019-12-18 18:03:33,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:33,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413812255] [2019-12-18 18:03:33,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:33,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:03:33,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529789133] [2019-12-18 18:03:33,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:33,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:33,419 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-18 18:03:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:33,496 INFO L93 Difference]: Finished difference Result 11993 states and 33125 transitions. [2019-12-18 18:03:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:03:33,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:03:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:33,520 INFO L225 Difference]: With dead ends: 11993 [2019-12-18 18:03:33,520 INFO L226 Difference]: Without dead ends: 8737 [2019-12-18 18:03:33,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:33,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2019-12-18 18:03:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8729. [2019-12-18 18:03:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8729 states. [2019-12-18 18:03:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 21886 transitions. [2019-12-18 18:03:33,669 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 21886 transitions. Word has length 11 [2019-12-18 18:03:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:33,669 INFO L462 AbstractCegarLoop]: Abstraction has 8729 states and 21886 transitions. [2019-12-18 18:03:33,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 21886 transitions. [2019-12-18 18:03:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:03:33,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:33,673 INFO L411 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] [2019-12-18 18:03:33,673 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-18 18:03:33,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:33,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040113285] [2019-12-18 18:03:33,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:33,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040113285] [2019-12-18 18:03:33,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:33,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:03:33,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290532476] [2019-12-18 18:03:33,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:03:33,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:33,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:03:33,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:33,850 INFO L87 Difference]: Start difference. First operand 8729 states and 21886 transitions. Second operand 5 states. [2019-12-18 18:03:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:34,525 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-18 18:03:34,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:03:34,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 18:03:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:34,546 INFO L225 Difference]: With dead ends: 10286 [2019-12-18 18:03:34,547 INFO L226 Difference]: Without dead ends: 10286 [2019-12-18 18:03:34,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:03:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-18 18:03:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-18 18:03:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-18 18:03:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-18 18:03:34,734 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-18 18:03:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:34,738 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-18 18:03:34,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:03:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-18 18:03:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 18:03:34,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:34,746 INFO L411 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] [2019-12-18 18:03:34,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:34,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-18 18:03:34,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:34,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9441300] [2019-12-18 18:03:34,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:34,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9441300] [2019-12-18 18:03:34,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:34,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:03:34,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750002388] [2019-12-18 18:03:34,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:03:34,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:34,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:03:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:03:34,967 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 6 states. [2019-12-18 18:03:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:35,954 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-18 18:03:35,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:03:35,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 18:03:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:35,973 INFO L225 Difference]: With dead ends: 11186 [2019-12-18 18:03:35,973 INFO L226 Difference]: Without dead ends: 11138 [2019-12-18 18:03:35,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:03:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-18 18:03:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-18 18:03:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-18 18:03:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-18 18:03:37,851 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-18 18:03:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:37,851 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-18 18:03:37,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:03:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-18 18:03:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 18:03:37,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:37,863 INFO L411 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] [2019-12-18 18:03:37,863 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:37,864 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-18 18:03:37,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:37,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142658739] [2019-12-18 18:03:37,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:38,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142658739] [2019-12-18 18:03:38,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:38,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:03:38,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054171385] [2019-12-18 18:03:38,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:03:38,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:38,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:03:38,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:03:38,036 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 8 states. [2019-12-18 18:03:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:39,812 INFO L93 Difference]: Finished difference Result 13021 states and 31545 transitions. [2019-12-18 18:03:39,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:03:39,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-18 18:03:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:39,831 INFO L225 Difference]: With dead ends: 13021 [2019-12-18 18:03:39,831 INFO L226 Difference]: Without dead ends: 13021 [2019-12-18 18:03:39,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:03:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2019-12-18 18:03:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 11791. [2019-12-18 18:03:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-18 18:03:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-18 18:03:40,046 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-18 18:03:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:40,047 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-18 18:03:40,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:03:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-18 18:03:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 18:03:40,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:40,064 INFO L411 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] [2019-12-18 18:03:40,064 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:40,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-18 18:03:40,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:40,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918668861] [2019-12-18 18:03:40,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:40,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918668861] [2019-12-18 18:03:40,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:40,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:03:40,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409028040] [2019-12-18 18:03:40,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:03:40,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:40,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:03:40,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:40,159 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-18 18:03:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:41,044 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-18 18:03:41,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:03:41,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 18:03:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:41,060 INFO L225 Difference]: With dead ends: 13152 [2019-12-18 18:03:41,060 INFO L226 Difference]: Without dead ends: 13152 [2019-12-18 18:03:41,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:03:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-18 18:03:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-18 18:03:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-18 18:03:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-18 18:03:41,209 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-18 18:03:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:41,210 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-18 18:03:41,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:03:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-18 18:03:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 18:03:41,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:41,224 INFO L411 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] [2019-12-18 18:03:41,224 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:41,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:41,224 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-18 18:03:41,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:41,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565572018] [2019-12-18 18:03:41,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:41,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565572018] [2019-12-18 18:03:41,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:41,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:03:41,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496617485] [2019-12-18 18:03:41,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:03:41,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:41,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:03:41,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:41,318 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-18 18:03:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:41,377 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-18 18:03:41,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:03:41,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 18:03:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:41,384 INFO L225 Difference]: With dead ends: 5405 [2019-12-18 18:03:41,385 INFO L226 Difference]: Without dead ends: 5151 [2019-12-18 18:03:41,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:03:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-18 18:03:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-18 18:03:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-18 18:03:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-18 18:03:41,444 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 58 [2019-12-18 18:03:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:41,444 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-18 18:03:41,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:03:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-18 18:03:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:03:41,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:41,451 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:41,451 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-18 18:03:41,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:41,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949370871] [2019-12-18 18:03:41,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:41,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949370871] [2019-12-18 18:03:41,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:41,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:03:41,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904454740] [2019-12-18 18:03:41,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:03:41,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:41,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:03:41,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:03:41,578 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-18 18:03:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:42,426 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-18 18:03:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:03:42,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 18:03:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:42,435 INFO L225 Difference]: With dead ends: 6626 [2019-12-18 18:03:42,435 INFO L226 Difference]: Without dead ends: 6626 [2019-12-18 18:03:42,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:03:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-18 18:03:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-18 18:03:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-18 18:03:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-18 18:03:42,505 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-18 18:03:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:42,505 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-18 18:03:42,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:03:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-18 18:03:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:03:42,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:42,514 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:42,514 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-18 18:03:42,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:42,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053388387] [2019-12-18 18:03:42,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:42,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053388387] [2019-12-18 18:03:42,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:42,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:03:42,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293645594] [2019-12-18 18:03:42,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:03:42,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:42,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:03:42,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:03:42,633 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 7 states. [2019-12-18 18:03:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:43,668 INFO L93 Difference]: Finished difference Result 7484 states and 17393 transitions. [2019-12-18 18:03:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:03:43,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 18:03:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:43,683 INFO L225 Difference]: With dead ends: 7484 [2019-12-18 18:03:43,683 INFO L226 Difference]: Without dead ends: 7484 [2019-12-18 18:03:43,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:03:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-12-18 18:03:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6666. [2019-12-18 18:03:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-12-18 18:03:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 15594 transitions. [2019-12-18 18:03:43,842 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 15594 transitions. Word has length 94 [2019-12-18 18:03:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:43,845 INFO L462 AbstractCegarLoop]: Abstraction has 6666 states and 15594 transitions. [2019-12-18 18:03:43,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:03:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 15594 transitions. [2019-12-18 18:03:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:03:43,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:43,875 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:43,875 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:43,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-18 18:03:43,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:43,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967521340] [2019-12-18 18:03:43,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:44,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967521340] [2019-12-18 18:03:44,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:44,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:03:44,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265250292] [2019-12-18 18:03:44,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:03:44,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:44,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:03:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:44,044 INFO L87 Difference]: Start difference. First operand 6666 states and 15594 transitions. Second operand 5 states. [2019-12-18 18:03:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:44,732 INFO L93 Difference]: Finished difference Result 7181 states and 16661 transitions. [2019-12-18 18:03:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:03:44,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 18:03:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:44,742 INFO L225 Difference]: With dead ends: 7181 [2019-12-18 18:03:44,742 INFO L226 Difference]: Without dead ends: 7181 [2019-12-18 18:03:44,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:03:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2019-12-18 18:03:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6807. [2019-12-18 18:03:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-18 18:03:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 15915 transitions. [2019-12-18 18:03:44,815 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 15915 transitions. Word has length 94 [2019-12-18 18:03:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:44,815 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 15915 transitions. [2019-12-18 18:03:44,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:03:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 15915 transitions. [2019-12-18 18:03:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:03:44,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:44,824 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:44,824 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-18 18:03:44,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:44,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714574372] [2019-12-18 18:03:44,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:44,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714574372] [2019-12-18 18:03:44,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:44,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:03:44,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927343947] [2019-12-18 18:03:44,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:03:44,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:44,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:03:44,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:03:44,939 INFO L87 Difference]: Start difference. First operand 6807 states and 15915 transitions. Second operand 6 states. [2019-12-18 18:03:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:45,609 INFO L93 Difference]: Finished difference Result 7132 states and 16535 transitions. [2019-12-18 18:03:45,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:03:45,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 18:03:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:45,619 INFO L225 Difference]: With dead ends: 7132 [2019-12-18 18:03:45,619 INFO L226 Difference]: Without dead ends: 7132 [2019-12-18 18:03:45,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:03:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2019-12-18 18:03:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 6891. [2019-12-18 18:03:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6891 states. [2019-12-18 18:03:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6891 states to 6891 states and 16087 transitions. [2019-12-18 18:03:45,698 INFO L78 Accepts]: Start accepts. Automaton has 6891 states and 16087 transitions. Word has length 94 [2019-12-18 18:03:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:45,698 INFO L462 AbstractCegarLoop]: Abstraction has 6891 states and 16087 transitions. [2019-12-18 18:03:45,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:03:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6891 states and 16087 transitions. [2019-12-18 18:03:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:03:45,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:45,708 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:45,708 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:45,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-18 18:03:45,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:45,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033764034] [2019-12-18 18:03:45,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:45,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033764034] [2019-12-18 18:03:45,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:45,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:03:45,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206205246] [2019-12-18 18:03:45,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:03:45,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:03:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:03:45,800 INFO L87 Difference]: Start difference. First operand 6891 states and 16087 transitions. Second operand 3 states. [2019-12-18 18:03:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:45,861 INFO L93 Difference]: Finished difference Result 6891 states and 16086 transitions. [2019-12-18 18:03:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:03:45,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 18:03:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:45,871 INFO L225 Difference]: With dead ends: 6891 [2019-12-18 18:03:45,871 INFO L226 Difference]: Without dead ends: 6891 [2019-12-18 18:03:45,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:03:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6891 states. [2019-12-18 18:03:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6891 to 6683. [2019-12-18 18:03:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2019-12-18 18:03:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 15685 transitions. [2019-12-18 18:03:45,978 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 15685 transitions. Word has length 94 [2019-12-18 18:03:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:45,979 INFO L462 AbstractCegarLoop]: Abstraction has 6683 states and 15685 transitions. [2019-12-18 18:03:45,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:03:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 15685 transitions. [2019-12-18 18:03:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:03:45,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:45,993 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:45,994 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash -524016775, now seen corresponding path program 1 times [2019-12-18 18:03:45,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:45,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214067747] [2019-12-18 18:03:45,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:46,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214067747] [2019-12-18 18:03:46,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:46,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:03:46,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223847972] [2019-12-18 18:03:46,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:03:46,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:03:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:03:46,194 INFO L87 Difference]: Start difference. First operand 6683 states and 15685 transitions. Second operand 9 states. [2019-12-18 18:03:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:47,028 INFO L93 Difference]: Finished difference Result 11522 states and 26946 transitions. [2019-12-18 18:03:47,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:03:47,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-18 18:03:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:47,040 INFO L225 Difference]: With dead ends: 11522 [2019-12-18 18:03:47,041 INFO L226 Difference]: Without dead ends: 9519 [2019-12-18 18:03:47,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:03:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9519 states. [2019-12-18 18:03:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9519 to 7990. [2019-12-18 18:03:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7990 states. [2019-12-18 18:03:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7990 states to 7990 states and 18918 transitions. [2019-12-18 18:03:47,140 INFO L78 Accepts]: Start accepts. Automaton has 7990 states and 18918 transitions. Word has length 95 [2019-12-18 18:03:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:47,140 INFO L462 AbstractCegarLoop]: Abstraction has 7990 states and 18918 transitions. [2019-12-18 18:03:47,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:03:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7990 states and 18918 transitions. [2019-12-18 18:03:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:03:47,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:47,150 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:47,151 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash 283458299, now seen corresponding path program 2 times [2019-12-18 18:03:47,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:47,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177720700] [2019-12-18 18:03:47,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:47,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177720700] [2019-12-18 18:03:47,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:47,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:03:47,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630171358] [2019-12-18 18:03:47,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:03:47,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:47,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:03:47,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:03:47,328 INFO L87 Difference]: Start difference. First operand 7990 states and 18918 transitions. Second operand 10 states. [2019-12-18 18:03:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:48,410 INFO L93 Difference]: Finished difference Result 12841 states and 30292 transitions. [2019-12-18 18:03:48,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:03:48,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-18 18:03:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:48,425 INFO L225 Difference]: With dead ends: 12841 [2019-12-18 18:03:48,426 INFO L226 Difference]: Without dead ends: 11420 [2019-12-18 18:03:48,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:03:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11420 states. [2019-12-18 18:03:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11420 to 8159. [2019-12-18 18:03:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8159 states. [2019-12-18 18:03:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8159 states to 8159 states and 19298 transitions. [2019-12-18 18:03:48,531 INFO L78 Accepts]: Start accepts. Automaton has 8159 states and 19298 transitions. Word has length 95 [2019-12-18 18:03:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:48,531 INFO L462 AbstractCegarLoop]: Abstraction has 8159 states and 19298 transitions. [2019-12-18 18:03:48,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:03:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8159 states and 19298 transitions. [2019-12-18 18:03:48,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:03:48,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:48,539 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:48,539 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:48,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:48,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1595101307, now seen corresponding path program 3 times [2019-12-18 18:03:48,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:48,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458243543] [2019-12-18 18:03:48,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:48,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458243543] [2019-12-18 18:03:48,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:48,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:03:48,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128477985] [2019-12-18 18:03:48,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:03:48,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:03:48,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:03:48,709 INFO L87 Difference]: Start difference. First operand 8159 states and 19298 transitions. Second operand 10 states. [2019-12-18 18:03:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:49,624 INFO L93 Difference]: Finished difference Result 11289 states and 26378 transitions. [2019-12-18 18:03:49,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:03:49,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-18 18:03:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:49,636 INFO L225 Difference]: With dead ends: 11289 [2019-12-18 18:03:49,636 INFO L226 Difference]: Without dead ends: 8600 [2019-12-18 18:03:49,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:03:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8600 states. [2019-12-18 18:03:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8600 to 7376. [2019-12-18 18:03:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7376 states. [2019-12-18 18:03:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7376 states to 7376 states and 17202 transitions. [2019-12-18 18:03:49,723 INFO L78 Accepts]: Start accepts. Automaton has 7376 states and 17202 transitions. Word has length 95 [2019-12-18 18:03:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:49,723 INFO L462 AbstractCegarLoop]: Abstraction has 7376 states and 17202 transitions. [2019-12-18 18:03:49,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:03:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 17202 transitions. [2019-12-18 18:03:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:03:49,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:49,730 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:49,730 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash 409927027, now seen corresponding path program 4 times [2019-12-18 18:03:49,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:49,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326831027] [2019-12-18 18:03:49,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:49,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326831027] [2019-12-18 18:03:49,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:49,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:03:49,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413752133] [2019-12-18 18:03:49,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:03:49,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:03:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:03:49,823 INFO L87 Difference]: Start difference. First operand 7376 states and 17202 transitions. Second operand 6 states. [2019-12-18 18:03:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:50,487 INFO L93 Difference]: Finished difference Result 7784 states and 18001 transitions. [2019-12-18 18:03:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:03:50,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-18 18:03:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:50,497 INFO L225 Difference]: With dead ends: 7784 [2019-12-18 18:03:50,497 INFO L226 Difference]: Without dead ends: 7784 [2019-12-18 18:03:50,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:03:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7784 states. [2019-12-18 18:03:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7784 to 7280. [2019-12-18 18:03:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7280 states. [2019-12-18 18:03:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7280 states to 7280 states and 17008 transitions. [2019-12-18 18:03:50,644 INFO L78 Accepts]: Start accepts. Automaton has 7280 states and 17008 transitions. Word has length 95 [2019-12-18 18:03:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:50,644 INFO L462 AbstractCegarLoop]: Abstraction has 7280 states and 17008 transitions. [2019-12-18 18:03:50,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:03:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7280 states and 17008 transitions. [2019-12-18 18:03:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:03:50,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:50,653 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:50,653 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1173487395, now seen corresponding path program 5 times [2019-12-18 18:03:50,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:50,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593820540] [2019-12-18 18:03:50,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:50,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593820540] [2019-12-18 18:03:50,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:50,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:03:50,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460212600] [2019-12-18 18:03:50,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:03:50,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:03:50,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:03:50,765 INFO L87 Difference]: Start difference. First operand 7280 states and 17008 transitions. Second operand 7 states. [2019-12-18 18:03:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:51,752 INFO L93 Difference]: Finished difference Result 9572 states and 22647 transitions. [2019-12-18 18:03:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:03:51,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:03:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:51,764 INFO L225 Difference]: With dead ends: 9572 [2019-12-18 18:03:51,765 INFO L226 Difference]: Without dead ends: 9572 [2019-12-18 18:03:51,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:03:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9572 states. [2019-12-18 18:03:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9572 to 7466. [2019-12-18 18:03:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-12-18 18:03:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 17446 transitions. [2019-12-18 18:03:51,856 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 17446 transitions. Word has length 95 [2019-12-18 18:03:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:51,856 INFO L462 AbstractCegarLoop]: Abstraction has 7466 states and 17446 transitions. [2019-12-18 18:03:51,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:03:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 17446 transitions. [2019-12-18 18:03:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:03:51,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:51,863 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:51,863 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash -658080155, now seen corresponding path program 6 times [2019-12-18 18:03:51,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:51,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466176291] [2019-12-18 18:03:51,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:52,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466176291] [2019-12-18 18:03:52,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:52,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:03:52,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842924529] [2019-12-18 18:03:52,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:03:52,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:52,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:03:52,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:03:52,018 INFO L87 Difference]: Start difference. First operand 7466 states and 17446 transitions. Second operand 7 states. [2019-12-18 18:03:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:52,329 INFO L93 Difference]: Finished difference Result 12779 states and 29977 transitions. [2019-12-18 18:03:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:03:52,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:03:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:52,342 INFO L225 Difference]: With dead ends: 12779 [2019-12-18 18:03:52,342 INFO L226 Difference]: Without dead ends: 10079 [2019-12-18 18:03:52,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:03:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10079 states. [2019-12-18 18:03:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10079 to 9560. [2019-12-18 18:03:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9560 states. [2019-12-18 18:03:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9560 states to 9560 states and 22791 transitions. [2019-12-18 18:03:52,453 INFO L78 Accepts]: Start accepts. Automaton has 9560 states and 22791 transitions. Word has length 95 [2019-12-18 18:03:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:52,454 INFO L462 AbstractCegarLoop]: Abstraction has 9560 states and 22791 transitions. [2019-12-18 18:03:52,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:03:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9560 states and 22791 transitions. [2019-12-18 18:03:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:03:52,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:52,468 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:52,468 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1365619281, now seen corresponding path program 7 times [2019-12-18 18:03:52,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:52,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396082399] [2019-12-18 18:03:52,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:52,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396082399] [2019-12-18 18:03:52,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:52,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:03:52,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305629215] [2019-12-18 18:03:52,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:52,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:52,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:52,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:52,551 INFO L87 Difference]: Start difference. First operand 9560 states and 22791 transitions. Second operand 4 states. [2019-12-18 18:03:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:52,972 INFO L93 Difference]: Finished difference Result 10838 states and 25847 transitions. [2019-12-18 18:03:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:03:52,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-18 18:03:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:52,987 INFO L225 Difference]: With dead ends: 10838 [2019-12-18 18:03:52,987 INFO L226 Difference]: Without dead ends: 10838 [2019-12-18 18:03:52,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10838 states. [2019-12-18 18:03:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10838 to 8432. [2019-12-18 18:03:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8432 states. [2019-12-18 18:03:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8432 states to 8432 states and 19740 transitions. [2019-12-18 18:03:53,176 INFO L78 Accepts]: Start accepts. Automaton has 8432 states and 19740 transitions. Word has length 95 [2019-12-18 18:03:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:53,176 INFO L462 AbstractCegarLoop]: Abstraction has 8432 states and 19740 transitions. [2019-12-18 18:03:53,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 8432 states and 19740 transitions. [2019-12-18 18:03:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:03:53,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:53,188 INFO L411 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, 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-12-18 18:03:53,189 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-18 18:03:53,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:53,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871848174] [2019-12-18 18:03:53,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:53,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871848174] [2019-12-18 18:03:53,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:53,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:03:53,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998999487] [2019-12-18 18:03:53,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:03:53,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:03:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:03:53,384 INFO L87 Difference]: Start difference. First operand 8432 states and 19740 transitions. Second operand 7 states. [2019-12-18 18:03:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:53,681 INFO L93 Difference]: Finished difference Result 10230 states and 23640 transitions. [2019-12-18 18:03:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:03:53,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 18:03:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:53,697 INFO L225 Difference]: With dead ends: 10230 [2019-12-18 18:03:53,697 INFO L226 Difference]: Without dead ends: 9208 [2019-12-18 18:03:53,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:03:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9208 states. [2019-12-18 18:03:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9208 to 8718. [2019-12-18 18:03:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8718 states. [2019-12-18 18:03:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 20421 transitions. [2019-12-18 18:03:53,846 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 20421 transitions. Word has length 96 [2019-12-18 18:03:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:53,846 INFO L462 AbstractCegarLoop]: Abstraction has 8718 states and 20421 transitions. [2019-12-18 18:03:53,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:03:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 20421 transitions. [2019-12-18 18:03:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:03:53,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:53,859 INFO L411 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, 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-12-18 18:03:53,859 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:53,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-18 18:03:53,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:53,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395125004] [2019-12-18 18:03:53,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:53,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395125004] [2019-12-18 18:03:53,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:53,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:03:53,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304525979] [2019-12-18 18:03:53,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:03:53,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:53,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:03:53,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:53,980 INFO L87 Difference]: Start difference. First operand 8718 states and 20421 transitions. Second operand 5 states. [2019-12-18 18:03:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:54,628 INFO L93 Difference]: Finished difference Result 10691 states and 25200 transitions. [2019-12-18 18:03:54,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:03:54,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-18 18:03:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:54,649 INFO L225 Difference]: With dead ends: 10691 [2019-12-18 18:03:54,649 INFO L226 Difference]: Without dead ends: 10691 [2019-12-18 18:03:54,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:03:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10691 states. [2019-12-18 18:03:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10691 to 9306. [2019-12-18 18:03:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9306 states. [2019-12-18 18:03:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9306 states to 9306 states and 21903 transitions. [2019-12-18 18:03:54,867 INFO L78 Accepts]: Start accepts. Automaton has 9306 states and 21903 transitions. Word has length 96 [2019-12-18 18:03:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:54,867 INFO L462 AbstractCegarLoop]: Abstraction has 9306 states and 21903 transitions. [2019-12-18 18:03:54,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:03:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 9306 states and 21903 transitions. [2019-12-18 18:03:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:03:54,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:54,881 INFO L411 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, 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-12-18 18:03:54,881 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:54,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:54,881 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 3 times [2019-12-18 18:03:54,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:54,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195647346] [2019-12-18 18:03:54,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:55,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195647346] [2019-12-18 18:03:55,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:55,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:03:55,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479365351] [2019-12-18 18:03:55,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:03:55,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:03:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:03:55,076 INFO L87 Difference]: Start difference. First operand 9306 states and 21903 transitions. Second operand 10 states. [2019-12-18 18:03:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:56,001 INFO L93 Difference]: Finished difference Result 16088 states and 37604 transitions. [2019-12-18 18:03:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:03:56,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:03:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:56,020 INFO L225 Difference]: With dead ends: 16088 [2019-12-18 18:03:56,020 INFO L226 Difference]: Without dead ends: 14999 [2019-12-18 18:03:56,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:03:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2019-12-18 18:03:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11036. [2019-12-18 18:03:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11036 states. [2019-12-18 18:03:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11036 states to 11036 states and 26515 transitions. [2019-12-18 18:03:56,192 INFO L78 Accepts]: Start accepts. Automaton has 11036 states and 26515 transitions. Word has length 96 [2019-12-18 18:03:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:56,192 INFO L462 AbstractCegarLoop]: Abstraction has 11036 states and 26515 transitions. [2019-12-18 18:03:56,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:03:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 11036 states and 26515 transitions. [2019-12-18 18:03:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:03:56,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:56,204 INFO L411 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, 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-12-18 18:03:56,204 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1281102864, now seen corresponding path program 4 times [2019-12-18 18:03:56,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:56,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025479632] [2019-12-18 18:03:56,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:56,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025479632] [2019-12-18 18:03:56,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:56,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:03:56,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216465116] [2019-12-18 18:03:56,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:03:56,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:03:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:03:56,640 INFO L87 Difference]: Start difference. First operand 11036 states and 26515 transitions. Second operand 12 states. [2019-12-18 18:03:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:58,273 INFO L93 Difference]: Finished difference Result 14479 states and 34335 transitions. [2019-12-18 18:03:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 18:03:58,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 18:03:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:58,289 INFO L225 Difference]: With dead ends: 14479 [2019-12-18 18:03:58,290 INFO L226 Difference]: Without dead ends: 13494 [2019-12-18 18:03:58,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 18:03:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13494 states. [2019-12-18 18:03:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13494 to 11678. [2019-12-18 18:03:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11678 states. [2019-12-18 18:03:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11678 states to 11678 states and 28103 transitions. [2019-12-18 18:03:58,430 INFO L78 Accepts]: Start accepts. Automaton has 11678 states and 28103 transitions. Word has length 96 [2019-12-18 18:03:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:58,430 INFO L462 AbstractCegarLoop]: Abstraction has 11678 states and 28103 transitions. [2019-12-18 18:03:58,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:03:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 11678 states and 28103 transitions. [2019-12-18 18:03:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:03:58,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:58,440 INFO L411 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, 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-12-18 18:03:58,441 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1267480048, now seen corresponding path program 5 times [2019-12-18 18:03:58,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:58,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620837477] [2019-12-18 18:03:58,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:58,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620837477] [2019-12-18 18:03:58,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:58,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:03:58,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387419530] [2019-12-18 18:03:58,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:03:58,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:58,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:03:58,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:03:58,597 INFO L87 Difference]: Start difference. First operand 11678 states and 28103 transitions. Second operand 10 states. [2019-12-18 18:03:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:59,662 INFO L93 Difference]: Finished difference Result 21872 states and 51561 transitions. [2019-12-18 18:03:59,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:03:59,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:03:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:59,685 INFO L225 Difference]: With dead ends: 21872 [2019-12-18 18:03:59,685 INFO L226 Difference]: Without dead ends: 21309 [2019-12-18 18:03:59,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:03:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21309 states. [2019-12-18 18:03:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21309 to 13525. [2019-12-18 18:03:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13525 states. [2019-12-18 18:03:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13525 states to 13525 states and 32545 transitions. [2019-12-18 18:03:59,890 INFO L78 Accepts]: Start accepts. Automaton has 13525 states and 32545 transitions. Word has length 96 [2019-12-18 18:03:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:59,890 INFO L462 AbstractCegarLoop]: Abstraction has 13525 states and 32545 transitions. [2019-12-18 18:03:59,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:03:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 13525 states and 32545 transitions. [2019-12-18 18:03:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:03:59,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:59,903 INFO L411 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, 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-12-18 18:03:59,903 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1826167002, now seen corresponding path program 6 times [2019-12-18 18:03:59,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:59,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780823236] [2019-12-18 18:03:59,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:00,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780823236] [2019-12-18 18:04:00,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:00,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:04:00,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671309308] [2019-12-18 18:04:00,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:04:00,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:04:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:00,108 INFO L87 Difference]: Start difference. First operand 13525 states and 32545 transitions. Second operand 12 states. [2019-12-18 18:04:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:01,393 INFO L93 Difference]: Finished difference Result 27682 states and 67488 transitions. [2019-12-18 18:04:01,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 18:04:01,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 18:04:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:01,422 INFO L225 Difference]: With dead ends: 27682 [2019-12-18 18:04:01,422 INFO L226 Difference]: Without dead ends: 24256 [2019-12-18 18:04:01,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2019-12-18 18:04:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24256 states. [2019-12-18 18:04:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24256 to 19398. [2019-12-18 18:04:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19398 states. [2019-12-18 18:04:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19398 states to 19398 states and 48130 transitions. [2019-12-18 18:04:01,697 INFO L78 Accepts]: Start accepts. Automaton has 19398 states and 48130 transitions. Word has length 96 [2019-12-18 18:04:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:01,698 INFO L462 AbstractCegarLoop]: Abstraction has 19398 states and 48130 transitions. [2019-12-18 18:04:01,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:04:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 19398 states and 48130 transitions. [2019-12-18 18:04:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:01,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:01,718 INFO L411 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, 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-12-18 18:04:01,718 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:01,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 7 times [2019-12-18 18:04:01,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:01,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897759786] [2019-12-18 18:04:01,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:02,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897759786] [2019-12-18 18:04:02,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:02,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:04:02,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630195561] [2019-12-18 18:04:02,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:04:02,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:04:02,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:04:02,012 INFO L87 Difference]: Start difference. First operand 19398 states and 48130 transitions. Second operand 13 states. [2019-12-18 18:04:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:02,952 INFO L93 Difference]: Finished difference Result 23454 states and 57901 transitions. [2019-12-18 18:04:02,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:04:02,953 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-18 18:04:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:02,976 INFO L225 Difference]: With dead ends: 23454 [2019-12-18 18:04:02,976 INFO L226 Difference]: Without dead ends: 23424 [2019-12-18 18:04:02,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:04:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23424 states. [2019-12-18 18:04:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23424 to 21912. [2019-12-18 18:04:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21912 states. [2019-12-18 18:04:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21912 states to 21912 states and 54544 transitions. [2019-12-18 18:04:03,223 INFO L78 Accepts]: Start accepts. Automaton has 21912 states and 54544 transitions. Word has length 96 [2019-12-18 18:04:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:03,223 INFO L462 AbstractCegarLoop]: Abstraction has 21912 states and 54544 transitions. [2019-12-18 18:04:03,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:04:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 21912 states and 54544 transitions. [2019-12-18 18:04:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:03,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:03,245 INFO L411 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, 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-12-18 18:04:03,246 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:03,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash 681291876, now seen corresponding path program 8 times [2019-12-18 18:04:03,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:03,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312191590] [2019-12-18 18:04:03,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:03,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312191590] [2019-12-18 18:04:03,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:03,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:03,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691129777] [2019-12-18 18:04:03,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:03,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:03,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:03,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:03,416 INFO L87 Difference]: Start difference. First operand 21912 states and 54544 transitions. Second operand 10 states. [2019-12-18 18:04:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:04,169 INFO L93 Difference]: Finished difference Result 27042 states and 66959 transitions. [2019-12-18 18:04:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:04:04,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:04,208 INFO L225 Difference]: With dead ends: 27042 [2019-12-18 18:04:04,208 INFO L226 Difference]: Without dead ends: 25321 [2019-12-18 18:04:04,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:04:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25321 states. [2019-12-18 18:04:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25321 to 22518. [2019-12-18 18:04:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22518 states. [2019-12-18 18:04:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22518 states to 22518 states and 56027 transitions. [2019-12-18 18:04:04,562 INFO L78 Accepts]: Start accepts. Automaton has 22518 states and 56027 transitions. Word has length 96 [2019-12-18 18:04:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:04,563 INFO L462 AbstractCegarLoop]: Abstraction has 22518 states and 56027 transitions. [2019-12-18 18:04:04,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22518 states and 56027 transitions. [2019-12-18 18:04:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:04,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:04,586 INFO L411 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, 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-12-18 18:04:04,586 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1463895870, now seen corresponding path program 9 times [2019-12-18 18:04:04,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:04,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180090172] [2019-12-18 18:04:04,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:04,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180090172] [2019-12-18 18:04:04,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:04,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:04:04,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564227743] [2019-12-18 18:04:04,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:04:04,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:04,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:04:04,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:04,785 INFO L87 Difference]: Start difference. First operand 22518 states and 56027 transitions. Second operand 11 states. [2019-12-18 18:04:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:05,587 INFO L93 Difference]: Finished difference Result 29695 states and 73941 transitions. [2019-12-18 18:04:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 18:04:05,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 18:04:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:05,636 INFO L225 Difference]: With dead ends: 29695 [2019-12-18 18:04:05,636 INFO L226 Difference]: Without dead ends: 28303 [2019-12-18 18:04:05,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:04:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28303 states. [2019-12-18 18:04:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28303 to 22743. [2019-12-18 18:04:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22743 states. [2019-12-18 18:04:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22743 states to 22743 states and 56661 transitions. [2019-12-18 18:04:06,096 INFO L78 Accepts]: Start accepts. Automaton has 22743 states and 56661 transitions. Word has length 96 [2019-12-18 18:04:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:06,097 INFO L462 AbstractCegarLoop]: Abstraction has 22743 states and 56661 transitions. [2019-12-18 18:04:06,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:04:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22743 states and 56661 transitions. [2019-12-18 18:04:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:06,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:06,119 INFO L411 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, 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-12-18 18:04:06,120 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:06,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:06,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1519428418, now seen corresponding path program 10 times [2019-12-18 18:04:06,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:06,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697899520] [2019-12-18 18:04:06,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:06,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697899520] [2019-12-18 18:04:06,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:06,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:04:06,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267823184] [2019-12-18 18:04:06,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:04:06,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:04:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:04:06,315 INFO L87 Difference]: Start difference. First operand 22743 states and 56661 transitions. Second operand 13 states. [2019-12-18 18:04:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:07,457 INFO L93 Difference]: Finished difference Result 30150 states and 75011 transitions. [2019-12-18 18:04:07,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 18:04:07,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-18 18:04:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:07,491 INFO L225 Difference]: With dead ends: 30150 [2019-12-18 18:04:07,491 INFO L226 Difference]: Without dead ends: 29318 [2019-12-18 18:04:07,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 18:04:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29318 states. [2019-12-18 18:04:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29318 to 22067. [2019-12-18 18:04:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22067 states. [2019-12-18 18:04:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22067 states to 22067 states and 54915 transitions. [2019-12-18 18:04:07,950 INFO L78 Accepts]: Start accepts. Automaton has 22067 states and 54915 transitions. Word has length 96 [2019-12-18 18:04:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:07,950 INFO L462 AbstractCegarLoop]: Abstraction has 22067 states and 54915 transitions. [2019-12-18 18:04:07,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:04:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 22067 states and 54915 transitions. [2019-12-18 18:04:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:07,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:07,969 INFO L411 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, 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-12-18 18:04:07,969 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1138120410, now seen corresponding path program 1 times [2019-12-18 18:04:07,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:07,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802281050] [2019-12-18 18:04:07,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:08,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802281050] [2019-12-18 18:04:08,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:08,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:04:08,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956292021] [2019-12-18 18:04:08,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:04:08,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:08,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:04:08,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:08,207 INFO L87 Difference]: Start difference. First operand 22067 states and 54915 transitions. Second operand 11 states. [2019-12-18 18:04:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:11,473 INFO L93 Difference]: Finished difference Result 34728 states and 85671 transitions. [2019-12-18 18:04:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 18:04:11,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 18:04:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:11,513 INFO L225 Difference]: With dead ends: 34728 [2019-12-18 18:04:11,514 INFO L226 Difference]: Without dead ends: 30401 [2019-12-18 18:04:11,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 18:04:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30401 states. [2019-12-18 18:04:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30401 to 24322. [2019-12-18 18:04:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24322 states. [2019-12-18 18:04:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24322 states to 24322 states and 60628 transitions. [2019-12-18 18:04:11,840 INFO L78 Accepts]: Start accepts. Automaton has 24322 states and 60628 transitions. Word has length 96 [2019-12-18 18:04:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:11,840 INFO L462 AbstractCegarLoop]: Abstraction has 24322 states and 60628 transitions. [2019-12-18 18:04:11,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:04:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24322 states and 60628 transitions. [2019-12-18 18:04:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:11,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:11,862 INFO L411 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, 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-12-18 18:04:11,862 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash -330645336, now seen corresponding path program 2 times [2019-12-18 18:04:11,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:11,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226292770] [2019-12-18 18:04:11,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:11,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226292770] [2019-12-18 18:04:11,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:11,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:04:11,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114722493] [2019-12-18 18:04:11,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:04:11,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:04:11,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:04:11,924 INFO L87 Difference]: Start difference. First operand 24322 states and 60628 transitions. Second operand 3 states. [2019-12-18 18:04:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:12,036 INFO L93 Difference]: Finished difference Result 21143 states and 53183 transitions. [2019-12-18 18:04:12,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:04:12,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-18 18:04:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:12,059 INFO L225 Difference]: With dead ends: 21143 [2019-12-18 18:04:12,059 INFO L226 Difference]: Without dead ends: 21143 [2019-12-18 18:04:12,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:04:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21143 states. [2019-12-18 18:04:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21143 to 21143. [2019-12-18 18:04:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21143 states. [2019-12-18 18:04:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21143 states to 21143 states and 53183 transitions. [2019-12-18 18:04:12,283 INFO L78 Accepts]: Start accepts. Automaton has 21143 states and 53183 transitions. Word has length 96 [2019-12-18 18:04:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:12,283 INFO L462 AbstractCegarLoop]: Abstraction has 21143 states and 53183 transitions. [2019-12-18 18:04:12,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:04:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21143 states and 53183 transitions. [2019-12-18 18:04:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:12,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:12,302 INFO L411 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, 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-12-18 18:04:12,302 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash 366867808, now seen corresponding path program 11 times [2019-12-18 18:04:12,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:12,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73986795] [2019-12-18 18:04:12,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:12,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73986795] [2019-12-18 18:04:12,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:12,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:12,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400106012] [2019-12-18 18:04:12,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:12,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:12,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:12,455 INFO L87 Difference]: Start difference. First operand 21143 states and 53183 transitions. Second operand 10 states. [2019-12-18 18:04:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:13,696 INFO L93 Difference]: Finished difference Result 33363 states and 84532 transitions. [2019-12-18 18:04:13,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 18:04:13,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:13,734 INFO L225 Difference]: With dead ends: 33363 [2019-12-18 18:04:13,734 INFO L226 Difference]: Without dead ends: 31631 [2019-12-18 18:04:13,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:04:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31631 states. [2019-12-18 18:04:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31631 to 21262. [2019-12-18 18:04:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21262 states. [2019-12-18 18:04:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21262 states to 21262 states and 53451 transitions. [2019-12-18 18:04:14,250 INFO L78 Accepts]: Start accepts. Automaton has 21262 states and 53451 transitions. Word has length 96 [2019-12-18 18:04:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:14,251 INFO L462 AbstractCegarLoop]: Abstraction has 21262 states and 53451 transitions. [2019-12-18 18:04:14,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21262 states and 53451 transitions. [2019-12-18 18:04:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:14,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:14,273 INFO L411 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, 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-12-18 18:04:14,274 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1149471802, now seen corresponding path program 12 times [2019-12-18 18:04:14,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:14,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823214563] [2019-12-18 18:04:14,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:14,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823214563] [2019-12-18 18:04:14,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:14,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:04:14,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545638203] [2019-12-18 18:04:14,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:14,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:14,494 INFO L87 Difference]: Start difference. First operand 21262 states and 53451 transitions. Second operand 10 states. [2019-12-18 18:04:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:15,888 INFO L93 Difference]: Finished difference Result 30669 states and 76834 transitions. [2019-12-18 18:04:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:04:15,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:15,922 INFO L225 Difference]: With dead ends: 30669 [2019-12-18 18:04:15,923 INFO L226 Difference]: Without dead ends: 30669 [2019-12-18 18:04:15,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:04:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30669 states. [2019-12-18 18:04:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30669 to 23954. [2019-12-18 18:04:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23954 states. [2019-12-18 18:04:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23954 states to 23954 states and 60051 transitions. [2019-12-18 18:04:16,234 INFO L78 Accepts]: Start accepts. Automaton has 23954 states and 60051 transitions. Word has length 96 [2019-12-18 18:04:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:16,234 INFO L462 AbstractCegarLoop]: Abstraction has 23954 states and 60051 transitions. [2019-12-18 18:04:16,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 23954 states and 60051 transitions. [2019-12-18 18:04:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:16,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:16,262 INFO L411 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, 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-12-18 18:04:16,263 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1270954248, now seen corresponding path program 13 times [2019-12-18 18:04:16,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:16,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405617213] [2019-12-18 18:04:16,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:16,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405617213] [2019-12-18 18:04:16,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:16,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:04:16,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557454598] [2019-12-18 18:04:16,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:04:16,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:16,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:04:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:16,455 INFO L87 Difference]: Start difference. First operand 23954 states and 60051 transitions. Second operand 11 states. [2019-12-18 18:04:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:18,212 INFO L93 Difference]: Finished difference Result 39327 states and 99127 transitions. [2019-12-18 18:04:18,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 18:04:18,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 18:04:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:18,256 INFO L225 Difference]: With dead ends: 39327 [2019-12-18 18:04:18,256 INFO L226 Difference]: Without dead ends: 37741 [2019-12-18 18:04:18,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-12-18 18:04:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37741 states. [2019-12-18 18:04:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37741 to 24817. [2019-12-18 18:04:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24817 states. [2019-12-18 18:04:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24817 states to 24817 states and 62178 transitions. [2019-12-18 18:04:18,604 INFO L78 Accepts]: Start accepts. Automaton has 24817 states and 62178 transitions. Word has length 96 [2019-12-18 18:04:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:18,604 INFO L462 AbstractCegarLoop]: Abstraction has 24817 states and 62178 transitions. [2019-12-18 18:04:18,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:04:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 24817 states and 62178 transitions. [2019-12-18 18:04:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:18,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:18,627 INFO L411 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, 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-12-18 18:04:18,627 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:18,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1833852486, now seen corresponding path program 14 times [2019-12-18 18:04:18,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:18,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19748605] [2019-12-18 18:04:18,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:18,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19748605] [2019-12-18 18:04:18,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:18,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:04:18,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560563945] [2019-12-18 18:04:18,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:04:18,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:18,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:04:18,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:04:18,822 INFO L87 Difference]: Start difference. First operand 24817 states and 62178 transitions. Second operand 13 states. [2019-12-18 18:04:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:21,376 INFO L93 Difference]: Finished difference Result 38453 states and 96176 transitions. [2019-12-18 18:04:21,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 18:04:21,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-18 18:04:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:21,415 INFO L225 Difference]: With dead ends: 38453 [2019-12-18 18:04:21,416 INFO L226 Difference]: Without dead ends: 37432 [2019-12-18 18:04:21,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=1862, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 18:04:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37432 states. [2019-12-18 18:04:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37432 to 24224. [2019-12-18 18:04:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24224 states. [2019-12-18 18:04:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24224 states to 24224 states and 60863 transitions. [2019-12-18 18:04:21,747 INFO L78 Accepts]: Start accepts. Automaton has 24224 states and 60863 transitions. Word has length 96 [2019-12-18 18:04:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:21,747 INFO L462 AbstractCegarLoop]: Abstraction has 24224 states and 60863 transitions. [2019-12-18 18:04:21,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:04:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24224 states and 60863 transitions. [2019-12-18 18:04:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:21,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:21,769 INFO L411 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, 1, 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-12-18 18:04:21,769 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-18 18:04:21,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:21,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869706330] [2019-12-18 18:04:21,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:22,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869706330] [2019-12-18 18:04:22,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:22,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:04:22,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416761032] [2019-12-18 18:04:22,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:04:22,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:04:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:04:22,197 INFO L87 Difference]: Start difference. First operand 24224 states and 60863 transitions. Second operand 15 states. [2019-12-18 18:04:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:27,717 INFO L93 Difference]: Finished difference Result 46456 states and 116645 transitions. [2019-12-18 18:04:27,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 18:04:27,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-12-18 18:04:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:27,771 INFO L225 Difference]: With dead ends: 46456 [2019-12-18 18:04:27,771 INFO L226 Difference]: Without dead ends: 43985 [2019-12-18 18:04:27,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=361, Invalid=1991, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 18:04:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43985 states. [2019-12-18 18:04:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43985 to 28194. [2019-12-18 18:04:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28194 states. [2019-12-18 18:04:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28194 states to 28194 states and 71608 transitions. [2019-12-18 18:04:28,218 INFO L78 Accepts]: Start accepts. Automaton has 28194 states and 71608 transitions. Word has length 97 [2019-12-18 18:04:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:28,219 INFO L462 AbstractCegarLoop]: Abstraction has 28194 states and 71608 transitions. [2019-12-18 18:04:28,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:04:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 28194 states and 71608 transitions. [2019-12-18 18:04:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:28,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:28,262 INFO L411 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, 1, 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-12-18 18:04:28,262 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:28,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-18 18:04:28,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:28,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568904047] [2019-12-18 18:04:28,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:28,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568904047] [2019-12-18 18:04:28,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:28,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:28,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087712294] [2019-12-18 18:04:28,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:28,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:28,388 INFO L87 Difference]: Start difference. First operand 28194 states and 71608 transitions. Second operand 6 states. [2019-12-18 18:04:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:28,563 INFO L93 Difference]: Finished difference Result 27524 states and 69855 transitions. [2019-12-18 18:04:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:04:28,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 18:04:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:28,595 INFO L225 Difference]: With dead ends: 27524 [2019-12-18 18:04:28,595 INFO L226 Difference]: Without dead ends: 27524 [2019-12-18 18:04:28,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:28,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27524 states. [2019-12-18 18:04:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27524 to 20617. [2019-12-18 18:04:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20617 states. [2019-12-18 18:04:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20617 states to 20617 states and 51975 transitions. [2019-12-18 18:04:29,080 INFO L78 Accepts]: Start accepts. Automaton has 20617 states and 51975 transitions. Word has length 97 [2019-12-18 18:04:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:29,080 INFO L462 AbstractCegarLoop]: Abstraction has 20617 states and 51975 transitions. [2019-12-18 18:04:29,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 20617 states and 51975 transitions. [2019-12-18 18:04:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:29,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:29,100 INFO L411 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, 1, 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-12-18 18:04:29,100 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-18 18:04:29,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:29,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788774172] [2019-12-18 18:04:29,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:29,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788774172] [2019-12-18 18:04:29,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:29,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 18:04:29,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862078769] [2019-12-18 18:04:29,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 18:04:29,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 18:04:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:04:29,692 INFO L87 Difference]: Start difference. First operand 20617 states and 51975 transitions. Second operand 23 states. [2019-12-18 18:04:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:35,171 INFO L93 Difference]: Finished difference Result 27065 states and 68163 transitions. [2019-12-18 18:04:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 18:04:35,172 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2019-12-18 18:04:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:35,205 INFO L225 Difference]: With dead ends: 27065 [2019-12-18 18:04:35,205 INFO L226 Difference]: Without dead ends: 27065 [2019-12-18 18:04:35,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 18:04:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27065 states. [2019-12-18 18:04:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27065 to 22637. [2019-12-18 18:04:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22637 states. [2019-12-18 18:04:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22637 states to 22637 states and 57105 transitions. [2019-12-18 18:04:35,490 INFO L78 Accepts]: Start accepts. Automaton has 22637 states and 57105 transitions. Word has length 97 [2019-12-18 18:04:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:35,491 INFO L462 AbstractCegarLoop]: Abstraction has 22637 states and 57105 transitions. [2019-12-18 18:04:35,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 18:04:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22637 states and 57105 transitions. [2019-12-18 18:04:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:35,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:35,510 INFO L411 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, 1, 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-12-18 18:04:35,510 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash -88108659, now seen corresponding path program 2 times [2019-12-18 18:04:35,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:35,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606174703] [2019-12-18 18:04:35,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:35,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606174703] [2019-12-18 18:04:35,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:35,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:35,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692503625] [2019-12-18 18:04:35,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:35,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:35,639 INFO L87 Difference]: Start difference. First operand 22637 states and 57105 transitions. Second operand 7 states. [2019-12-18 18:04:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:36,643 INFO L93 Difference]: Finished difference Result 32973 states and 82485 transitions. [2019-12-18 18:04:36,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:04:36,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 18:04:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:36,681 INFO L225 Difference]: With dead ends: 32973 [2019-12-18 18:04:36,681 INFO L226 Difference]: Without dead ends: 32964 [2019-12-18 18:04:36,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32964 states. [2019-12-18 18:04:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32964 to 23465. [2019-12-18 18:04:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23465 states. [2019-12-18 18:04:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23465 states to 23465 states and 58940 transitions. [2019-12-18 18:04:36,992 INFO L78 Accepts]: Start accepts. Automaton has 23465 states and 58940 transitions. Word has length 97 [2019-12-18 18:04:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:36,992 INFO L462 AbstractCegarLoop]: Abstraction has 23465 states and 58940 transitions. [2019-12-18 18:04:36,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 23465 states and 58940 transitions. [2019-12-18 18:04:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:37,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:37,012 INFO L411 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, 1, 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-12-18 18:04:37,012 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash 559739879, now seen corresponding path program 3 times [2019-12-18 18:04:37,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:37,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75876137] [2019-12-18 18:04:37,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:37,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75876137] [2019-12-18 18:04:37,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:37,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:37,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589000927] [2019-12-18 18:04:37,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:37,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:37,121 INFO L87 Difference]: Start difference. First operand 23465 states and 58940 transitions. Second operand 6 states. [2019-12-18 18:04:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:37,886 INFO L93 Difference]: Finished difference Result 30942 states and 77132 transitions. [2019-12-18 18:04:37,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:04:37,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 18:04:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:37,921 INFO L225 Difference]: With dead ends: 30942 [2019-12-18 18:04:37,921 INFO L226 Difference]: Without dead ends: 30942 [2019-12-18 18:04:37,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30942 states. [2019-12-18 18:04:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30942 to 24308. [2019-12-18 18:04:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24308 states. [2019-12-18 18:04:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24308 states to 24308 states and 61070 transitions. [2019-12-18 18:04:38,236 INFO L78 Accepts]: Start accepts. Automaton has 24308 states and 61070 transitions. Word has length 97 [2019-12-18 18:04:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:38,237 INFO L462 AbstractCegarLoop]: Abstraction has 24308 states and 61070 transitions. [2019-12-18 18:04:38,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 24308 states and 61070 transitions. [2019-12-18 18:04:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:38,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:38,262 INFO L411 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, 1, 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-12-18 18:04:38,262 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:38,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 4 times [2019-12-18 18:04:38,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:38,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065597633] [2019-12-18 18:04:38,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:38,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065597633] [2019-12-18 18:04:38,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:38,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 18:04:38,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95719197] [2019-12-18 18:04:38,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 18:04:38,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 18:04:38,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 18:04:38,907 INFO L87 Difference]: Start difference. First operand 24308 states and 61070 transitions. Second operand 24 states. [2019-12-18 18:04:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:43,041 INFO L93 Difference]: Finished difference Result 29161 states and 73405 transitions. [2019-12-18 18:04:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 18:04:43,042 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2019-12-18 18:04:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:43,075 INFO L225 Difference]: With dead ends: 29161 [2019-12-18 18:04:43,075 INFO L226 Difference]: Without dead ends: 29161 [2019-12-18 18:04:43,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 18:04:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29161 states. [2019-12-18 18:04:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29161 to 24528. [2019-12-18 18:04:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24528 states. [2019-12-18 18:04:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24528 states to 24528 states and 61568 transitions. [2019-12-18 18:04:43,371 INFO L78 Accepts]: Start accepts. Automaton has 24528 states and 61568 transitions. Word has length 97 [2019-12-18 18:04:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:43,372 INFO L462 AbstractCegarLoop]: Abstraction has 24528 states and 61568 transitions. [2019-12-18 18:04:43,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 18:04:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 24528 states and 61568 transitions. [2019-12-18 18:04:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:43,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:43,397 INFO L411 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, 1, 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-12-18 18:04:43,397 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash -648007813, now seen corresponding path program 5 times [2019-12-18 18:04:43,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:43,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058264386] [2019-12-18 18:04:43,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:43,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058264386] [2019-12-18 18:04:43,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:43,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:04:43,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365908776] [2019-12-18 18:04:43,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:04:43,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:43,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:04:43,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:43,531 INFO L87 Difference]: Start difference. First operand 24528 states and 61568 transitions. Second operand 8 states. [2019-12-18 18:04:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:44,749 INFO L93 Difference]: Finished difference Result 30407 states and 75461 transitions. [2019-12-18 18:04:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:04:44,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 18:04:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:44,784 INFO L225 Difference]: With dead ends: 30407 [2019-12-18 18:04:44,785 INFO L226 Difference]: Without dead ends: 30400 [2019-12-18 18:04:44,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30400 states. [2019-12-18 18:04:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30400 to 23513. [2019-12-18 18:04:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23513 states. [2019-12-18 18:04:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23513 states to 23513 states and 59051 transitions. [2019-12-18 18:04:45,096 INFO L78 Accepts]: Start accepts. Automaton has 23513 states and 59051 transitions. Word has length 97 [2019-12-18 18:04:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:45,097 INFO L462 AbstractCegarLoop]: Abstraction has 23513 states and 59051 transitions. [2019-12-18 18:04:45,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:04:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 23513 states and 59051 transitions. [2019-12-18 18:04:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:45,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:45,122 INFO L411 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, 1, 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-12-18 18:04:45,122 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 6 times [2019-12-18 18:04:45,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:45,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602580535] [2019-12-18 18:04:45,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:45,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602580535] [2019-12-18 18:04:45,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:45,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:04:45,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80314006] [2019-12-18 18:04:45,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:04:45,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:04:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:45,377 INFO L87 Difference]: Start difference. First operand 23513 states and 59051 transitions. Second operand 11 states. [2019-12-18 18:04:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:47,099 INFO L93 Difference]: Finished difference Result 30706 states and 75789 transitions. [2019-12-18 18:04:47,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:04:47,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 18:04:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:47,133 INFO L225 Difference]: With dead ends: 30706 [2019-12-18 18:04:47,133 INFO L226 Difference]: Without dead ends: 30706 [2019-12-18 18:04:47,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:04:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30706 states. [2019-12-18 18:04:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30706 to 23883. [2019-12-18 18:04:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23883 states. [2019-12-18 18:04:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23883 states to 23883 states and 59875 transitions. [2019-12-18 18:04:47,449 INFO L78 Accepts]: Start accepts. Automaton has 23883 states and 59875 transitions. Word has length 97 [2019-12-18 18:04:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:47,449 INFO L462 AbstractCegarLoop]: Abstraction has 23883 states and 59875 transitions. [2019-12-18 18:04:47,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:04:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 23883 states and 59875 transitions. [2019-12-18 18:04:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:47,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:47,470 INFO L411 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, 1, 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-12-18 18:04:47,470 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 7 times [2019-12-18 18:04:47,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:47,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3723900] [2019-12-18 18:04:47,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:47,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3723900] [2019-12-18 18:04:47,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:47,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:04:47,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095028112] [2019-12-18 18:04:47,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:04:47,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:47,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:04:47,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:04:47,818 INFO L87 Difference]: Start difference. First operand 23883 states and 59875 transitions. Second operand 16 states. [2019-12-18 18:04:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:50,604 INFO L93 Difference]: Finished difference Result 47007 states and 117406 transitions. [2019-12-18 18:04:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 18:04:50,604 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2019-12-18 18:04:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:50,654 INFO L225 Difference]: With dead ends: 47007 [2019-12-18 18:04:50,654 INFO L226 Difference]: Without dead ends: 41805 [2019-12-18 18:04:50,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=446, Invalid=2524, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 18:04:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41805 states. [2019-12-18 18:04:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41805 to 29426. [2019-12-18 18:04:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29426 states. [2019-12-18 18:04:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29426 states to 29426 states and 74320 transitions. [2019-12-18 18:04:51,116 INFO L78 Accepts]: Start accepts. Automaton has 29426 states and 74320 transitions. Word has length 97 [2019-12-18 18:04:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:51,117 INFO L462 AbstractCegarLoop]: Abstraction has 29426 states and 74320 transitions. [2019-12-18 18:04:51,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:04:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29426 states and 74320 transitions. [2019-12-18 18:04:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:51,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:51,152 INFO L411 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, 1, 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-12-18 18:04:51,153 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 8 times [2019-12-18 18:04:51,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:51,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859307277] [2019-12-18 18:04:51,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:51,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859307277] [2019-12-18 18:04:51,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:51,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:51,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189599608] [2019-12-18 18:04:51,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:51,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:51,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:51,240 INFO L87 Difference]: Start difference. First operand 29426 states and 74320 transitions. Second operand 7 states. [2019-12-18 18:04:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:51,923 INFO L93 Difference]: Finished difference Result 30669 states and 77179 transitions. [2019-12-18 18:04:51,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:04:51,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 18:04:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:51,960 INFO L225 Difference]: With dead ends: 30669 [2019-12-18 18:04:51,960 INFO L226 Difference]: Without dead ends: 30669 [2019-12-18 18:04:51,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:04:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30669 states. [2019-12-18 18:04:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30669 to 29453. [2019-12-18 18:04:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29453 states. [2019-12-18 18:04:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29453 states to 29453 states and 74437 transitions. [2019-12-18 18:04:52,308 INFO L78 Accepts]: Start accepts. Automaton has 29453 states and 74437 transitions. Word has length 97 [2019-12-18 18:04:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:52,308 INFO L462 AbstractCegarLoop]: Abstraction has 29453 states and 74437 transitions. [2019-12-18 18:04:52,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 29453 states and 74437 transitions. [2019-12-18 18:04:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:52,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:52,336 INFO L411 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, 1, 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-12-18 18:04:52,336 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1745288123, now seen corresponding path program 9 times [2019-12-18 18:04:52,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:52,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562131377] [2019-12-18 18:04:52,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:52,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562131377] [2019-12-18 18:04:52,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:52,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:52,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376279594] [2019-12-18 18:04:52,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:52,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:52,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:52,463 INFO L87 Difference]: Start difference. First operand 29453 states and 74437 transitions. Second operand 6 states. [2019-12-18 18:04:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:53,187 INFO L93 Difference]: Finished difference Result 29466 states and 74437 transitions. [2019-12-18 18:04:53,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:04:53,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 18:04:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:53,233 INFO L225 Difference]: With dead ends: 29466 [2019-12-18 18:04:53,234 INFO L226 Difference]: Without dead ends: 29466 [2019-12-18 18:04:53,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29466 states. [2019-12-18 18:04:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29466 to 29217. [2019-12-18 18:04:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29217 states. [2019-12-18 18:04:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29217 states to 29217 states and 73869 transitions. [2019-12-18 18:04:53,570 INFO L78 Accepts]: Start accepts. Automaton has 29217 states and 73869 transitions. Word has length 97 [2019-12-18 18:04:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:53,570 INFO L462 AbstractCegarLoop]: Abstraction has 29217 states and 73869 transitions. [2019-12-18 18:04:53,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 29217 states and 73869 transitions. [2019-12-18 18:04:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:53,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:53,598 INFO L411 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, 1, 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-12-18 18:04:53,598 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:53,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1192282811, now seen corresponding path program 10 times [2019-12-18 18:04:53,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:53,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303179834] [2019-12-18 18:04:53,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:53,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303179834] [2019-12-18 18:04:53,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:53,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:04:53,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649554942] [2019-12-18 18:04:53,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:04:53,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:53,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:04:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:53,754 INFO L87 Difference]: Start difference. First operand 29217 states and 73869 transitions. Second operand 9 states. [2019-12-18 18:04:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:54,578 INFO L93 Difference]: Finished difference Result 36603 states and 92373 transitions. [2019-12-18 18:04:54,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:04:54,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 18:04:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:54,627 INFO L225 Difference]: With dead ends: 36603 [2019-12-18 18:04:54,628 INFO L226 Difference]: Without dead ends: 36603 [2019-12-18 18:04:54,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36603 states. [2019-12-18 18:04:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36603 to 29635. [2019-12-18 18:04:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29635 states. [2019-12-18 18:04:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29635 states to 29635 states and 74855 transitions. [2019-12-18 18:04:55,060 INFO L78 Accepts]: Start accepts. Automaton has 29635 states and 74855 transitions. Word has length 97 [2019-12-18 18:04:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:55,060 INFO L462 AbstractCegarLoop]: Abstraction has 29635 states and 74855 transitions. [2019-12-18 18:04:55,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:04:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 29635 states and 74855 transitions. [2019-12-18 18:04:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:55,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:55,094 INFO L411 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, 1, 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-12-18 18:04:55,094 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1147784417, now seen corresponding path program 11 times [2019-12-18 18:04:55,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:55,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312721944] [2019-12-18 18:04:55,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:55,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312721944] [2019-12-18 18:04:55,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:55,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:55,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140045034] [2019-12-18 18:04:55,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:55,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:55,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:55,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:55,286 INFO L87 Difference]: Start difference. First operand 29635 states and 74855 transitions. Second operand 10 states. [2019-12-18 18:04:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:56,786 INFO L93 Difference]: Finished difference Result 41107 states and 103509 transitions. [2019-12-18 18:04:56,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:04:56,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 18:04:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:56,833 INFO L225 Difference]: With dead ends: 41107 [2019-12-18 18:04:56,833 INFO L226 Difference]: Without dead ends: 41100 [2019-12-18 18:04:56,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:04:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41100 states. [2019-12-18 18:04:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41100 to 27237. [2019-12-18 18:04:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27237 states. [2019-12-18 18:04:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27237 states to 27237 states and 68651 transitions. [2019-12-18 18:04:57,194 INFO L78 Accepts]: Start accepts. Automaton has 27237 states and 68651 transitions. Word has length 97 [2019-12-18 18:04:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:57,195 INFO L462 AbstractCegarLoop]: Abstraction has 27237 states and 68651 transitions. [2019-12-18 18:04:57,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 27237 states and 68651 transitions. [2019-12-18 18:04:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:57,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:57,219 INFO L411 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, 1, 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-12-18 18:04:57,219 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:57,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1419727447, now seen corresponding path program 12 times [2019-12-18 18:04:57,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:57,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479854034] [2019-12-18 18:04:57,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:57,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479854034] [2019-12-18 18:04:57,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:57,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:04:57,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969095746] [2019-12-18 18:04:57,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:04:57,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:57,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:04:57,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:57,365 INFO L87 Difference]: Start difference. First operand 27237 states and 68651 transitions. Second operand 9 states. [2019-12-18 18:04:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:58,332 INFO L93 Difference]: Finished difference Result 37015 states and 93044 transitions. [2019-12-18 18:04:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:04:58,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 18:04:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:58,375 INFO L225 Difference]: With dead ends: 37015 [2019-12-18 18:04:58,375 INFO L226 Difference]: Without dead ends: 37015 [2019-12-18 18:04:58,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:04:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37015 states. [2019-12-18 18:04:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37015 to 28177. [2019-12-18 18:04:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28177 states. [2019-12-18 18:04:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28177 states to 28177 states and 71149 transitions. [2019-12-18 18:04:58,929 INFO L78 Accepts]: Start accepts. Automaton has 28177 states and 71149 transitions. Word has length 97 [2019-12-18 18:04:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:58,929 INFO L462 AbstractCegarLoop]: Abstraction has 28177 states and 71149 transitions. [2019-12-18 18:04:58,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:04:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28177 states and 71149 transitions. [2019-12-18 18:04:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:04:58,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:58,957 INFO L411 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, 1, 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-12-18 18:04:58,958 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:58,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:58,958 INFO L82 PathProgramCache]: Analyzing trace with hash -920339781, now seen corresponding path program 13 times [2019-12-18 18:04:58,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:58,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956019588] [2019-12-18 18:04:58,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:59,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956019588] [2019-12-18 18:04:59,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:59,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:59,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939813383] [2019-12-18 18:04:59,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:59,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:59,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:59,178 INFO L87 Difference]: Start difference. First operand 28177 states and 71149 transitions. Second operand 10 states. [2019-12-18 18:05:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:00,421 INFO L93 Difference]: Finished difference Result 42220 states and 105771 transitions. [2019-12-18 18:05:00,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:05:00,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 18:05:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:00,469 INFO L225 Difference]: With dead ends: 42220 [2019-12-18 18:05:00,469 INFO L226 Difference]: Without dead ends: 42213 [2019-12-18 18:05:00,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:05:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42213 states. [2019-12-18 18:05:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42213 to 23802. [2019-12-18 18:05:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23802 states. [2019-12-18 18:05:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23802 states to 23802 states and 59583 transitions. [2019-12-18 18:05:00,825 INFO L78 Accepts]: Start accepts. Automaton has 23802 states and 59583 transitions. Word has length 97 [2019-12-18 18:05:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:00,826 INFO L462 AbstractCegarLoop]: Abstraction has 23802 states and 59583 transitions. [2019-12-18 18:05:00,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 23802 states and 59583 transitions. [2019-12-18 18:05:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:00,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:00,847 INFO L411 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, 1, 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-12-18 18:05:00,847 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash 632383657, now seen corresponding path program 14 times [2019-12-18 18:05:00,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:00,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213481185] [2019-12-18 18:05:00,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:00,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213481185] [2019-12-18 18:05:00,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:00,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:05:00,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129167156] [2019-12-18 18:05:00,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:05:00,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:05:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:05:00,980 INFO L87 Difference]: Start difference. First operand 23802 states and 59583 transitions. Second operand 9 states. [2019-12-18 18:05:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:01,976 INFO L93 Difference]: Finished difference Result 32168 states and 80213 transitions. [2019-12-18 18:05:01,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:05:01,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 18:05:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:02,018 INFO L225 Difference]: With dead ends: 32168 [2019-12-18 18:05:02,018 INFO L226 Difference]: Without dead ends: 32168 [2019-12-18 18:05:02,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:05:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32168 states. [2019-12-18 18:05:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32168 to 24133. [2019-12-18 18:05:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24133 states. [2019-12-18 18:05:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24133 states to 24133 states and 60416 transitions. [2019-12-18 18:05:02,335 INFO L78 Accepts]: Start accepts. Automaton has 24133 states and 60416 transitions. Word has length 97 [2019-12-18 18:05:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:02,335 INFO L462 AbstractCegarLoop]: Abstraction has 24133 states and 60416 transitions. [2019-12-18 18:05:02,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:05:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24133 states and 60416 transitions. [2019-12-18 18:05:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:02,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:02,357 INFO L411 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, 1, 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-12-18 18:05:02,357 INFO L410 AbstractCegarLoop]: === Iteration 53 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:02,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1707683571, now seen corresponding path program 15 times [2019-12-18 18:05:02,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:02,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29361651] [2019-12-18 18:05:02,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:02,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29361651] [2019-12-18 18:05:02,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:02,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:02,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016495254] [2019-12-18 18:05:02,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:02,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:02,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:02,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:02,541 INFO L87 Difference]: Start difference. First operand 24133 states and 60416 transitions. Second operand 11 states. [2019-12-18 18:05:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:04,301 INFO L93 Difference]: Finished difference Result 30505 states and 75795 transitions. [2019-12-18 18:05:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 18:05:04,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 18:05:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:04,338 INFO L225 Difference]: With dead ends: 30505 [2019-12-18 18:05:04,338 INFO L226 Difference]: Without dead ends: 30505 [2019-12-18 18:05:04,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:05:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30505 states. [2019-12-18 18:05:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30505 to 23836. [2019-12-18 18:05:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23836 states. [2019-12-18 18:05:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23836 states to 23836 states and 59661 transitions. [2019-12-18 18:05:04,644 INFO L78 Accepts]: Start accepts. Automaton has 23836 states and 59661 transitions. Word has length 97 [2019-12-18 18:05:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:04,644 INFO L462 AbstractCegarLoop]: Abstraction has 23836 states and 59661 transitions. [2019-12-18 18:05:04,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23836 states and 59661 transitions. [2019-12-18 18:05:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:04,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:04,668 INFO L411 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, 1, 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-12-18 18:05:04,668 INFO L410 AbstractCegarLoop]: === Iteration 54 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1370693787, now seen corresponding path program 16 times [2019-12-18 18:05:04,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:04,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773137043] [2019-12-18 18:05:04,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:05,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773137043] [2019-12-18 18:05:05,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:05,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:05,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639596027] [2019-12-18 18:05:05,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:05,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:05,027 INFO L87 Difference]: Start difference. First operand 23836 states and 59661 transitions. Second operand 11 states. [2019-12-18 18:05:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:06,724 INFO L93 Difference]: Finished difference Result 35263 states and 87867 transitions. [2019-12-18 18:05:06,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:05:06,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 18:05:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:06,764 INFO L225 Difference]: With dead ends: 35263 [2019-12-18 18:05:06,765 INFO L226 Difference]: Without dead ends: 35249 [2019-12-18 18:05:06,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:05:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35249 states. [2019-12-18 18:05:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35249 to 24744. [2019-12-18 18:05:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24744 states. [2019-12-18 18:05:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24744 states to 24744 states and 62032 transitions. [2019-12-18 18:05:07,091 INFO L78 Accepts]: Start accepts. Automaton has 24744 states and 62032 transitions. Word has length 97 [2019-12-18 18:05:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:07,091 INFO L462 AbstractCegarLoop]: Abstraction has 24744 states and 62032 transitions. [2019-12-18 18:05:07,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 24744 states and 62032 transitions. [2019-12-18 18:05:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:07,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:07,115 INFO L411 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, 1, 1, 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-12-18 18:05:07,115 INFO L410 AbstractCegarLoop]: === Iteration 55 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash -758422154, now seen corresponding path program 1 times [2019-12-18 18:05:07,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:07,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044321062] [2019-12-18 18:05:07,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:07,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044321062] [2019-12-18 18:05:07,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:07,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:05:07,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556133408] [2019-12-18 18:05:07,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 18:05:07,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:07,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 18:05:07,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:05:07,902 INFO L87 Difference]: Start difference. First operand 24744 states and 62032 transitions. Second operand 20 states. [2019-12-18 18:05:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:15,418 INFO L93 Difference]: Finished difference Result 36185 states and 90476 transitions. [2019-12-18 18:05:15,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-18 18:05:15,419 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-12-18 18:05:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:15,462 INFO L225 Difference]: With dead ends: 36185 [2019-12-18 18:05:15,462 INFO L226 Difference]: Without dead ends: 35124 [2019-12-18 18:05:15,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=590, Invalid=3570, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 18:05:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35124 states. [2019-12-18 18:05:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35124 to 24966. [2019-12-18 18:05:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24966 states. [2019-12-18 18:05:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24966 states to 24966 states and 62564 transitions. [2019-12-18 18:05:15,817 INFO L78 Accepts]: Start accepts. Automaton has 24966 states and 62564 transitions. Word has length 98 [2019-12-18 18:05:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:15,817 INFO L462 AbstractCegarLoop]: Abstraction has 24966 states and 62564 transitions. [2019-12-18 18:05:15,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 18:05:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 24966 states and 62564 transitions. [2019-12-18 18:05:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:15,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:15,843 INFO L411 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, 1, 1, 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-12-18 18:05:15,843 INFO L410 AbstractCegarLoop]: === Iteration 56 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash 820119886, now seen corresponding path program 2 times [2019-12-18 18:05:15,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:15,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828943214] [2019-12-18 18:05:15,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:16,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828943214] [2019-12-18 18:05:16,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:16,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:05:16,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134043462] [2019-12-18 18:05:16,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:05:16,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:05:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:05:16,460 INFO L87 Difference]: Start difference. First operand 24966 states and 62564 transitions. Second operand 16 states. [2019-12-18 18:05:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:21,576 INFO L93 Difference]: Finished difference Result 52699 states and 132209 transitions. [2019-12-18 18:05:21,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 18:05:21,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 98 [2019-12-18 18:05:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:21,636 INFO L225 Difference]: With dead ends: 52699 [2019-12-18 18:05:21,636 INFO L226 Difference]: Without dead ends: 48332 [2019-12-18 18:05:21,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=383, Invalid=2479, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 18:05:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48332 states. [2019-12-18 18:05:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48332 to 25875. [2019-12-18 18:05:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25875 states. [2019-12-18 18:05:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25875 states to 25875 states and 64802 transitions. [2019-12-18 18:05:22,075 INFO L78 Accepts]: Start accepts. Automaton has 25875 states and 64802 transitions. Word has length 98 [2019-12-18 18:05:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:22,075 INFO L462 AbstractCegarLoop]: Abstraction has 25875 states and 64802 transitions. [2019-12-18 18:05:22,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:05:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 25875 states and 64802 transitions. [2019-12-18 18:05:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:22,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:22,101 INFO L411 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, 1, 1, 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-12-18 18:05:22,101 INFO L410 AbstractCegarLoop]: === Iteration 57 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1700655026, now seen corresponding path program 3 times [2019-12-18 18:05:22,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:22,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032605181] [2019-12-18 18:05:22,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:23,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032605181] [2019-12-18 18:05:23,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:23,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 18:05:23,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364800593] [2019-12-18 18:05:23,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 18:05:23,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 18:05:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:05:23,539 INFO L87 Difference]: Start difference. First operand 25875 states and 64802 transitions. Second operand 23 states. [2019-12-18 18:05:28,461 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-12-18 18:05:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:35,414 INFO L93 Difference]: Finished difference Result 39499 states and 98934 transitions. [2019-12-18 18:05:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-18 18:05:35,415 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 98 [2019-12-18 18:05:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:35,459 INFO L225 Difference]: With dead ends: 39499 [2019-12-18 18:05:35,460 INFO L226 Difference]: Without dead ends: 38856 [2019-12-18 18:05:35,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=773, Invalid=5233, Unknown=0, NotChecked=0, Total=6006 [2019-12-18 18:05:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38856 states. [2019-12-18 18:05:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38856 to 27941. [2019-12-18 18:05:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27941 states. [2019-12-18 18:05:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27941 states to 27941 states and 70230 transitions. [2019-12-18 18:05:35,855 INFO L78 Accepts]: Start accepts. Automaton has 27941 states and 70230 transitions. Word has length 98 [2019-12-18 18:05:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:35,855 INFO L462 AbstractCegarLoop]: Abstraction has 27941 states and 70230 transitions. [2019-12-18 18:05:35,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 18:05:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 27941 states and 70230 transitions. [2019-12-18 18:05:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:35,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:35,881 INFO L411 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, 1, 1, 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-12-18 18:05:35,881 INFO L410 AbstractCegarLoop]: === Iteration 58 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1640660310, now seen corresponding path program 4 times [2019-12-18 18:05:35,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:35,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301485243] [2019-12-18 18:05:35,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:37,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301485243] [2019-12-18 18:05:37,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:37,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 18:05:37,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869024496] [2019-12-18 18:05:37,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 18:05:37,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:37,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 18:05:37,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:05:37,152 INFO L87 Difference]: Start difference. First operand 27941 states and 70230 transitions. Second operand 23 states. [2019-12-18 18:05:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:48,653 INFO L93 Difference]: Finished difference Result 38815 states and 97221 transitions. [2019-12-18 18:05:48,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-18 18:05:48,653 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 98 [2019-12-18 18:05:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:48,698 INFO L225 Difference]: With dead ends: 38815 [2019-12-18 18:05:48,698 INFO L226 Difference]: Without dead ends: 38326 [2019-12-18 18:05:48,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=956, Invalid=6354, Unknown=0, NotChecked=0, Total=7310 [2019-12-18 18:05:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38326 states. [2019-12-18 18:05:49,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38326 to 27941. [2019-12-18 18:05:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27941 states. [2019-12-18 18:05:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27941 states to 27941 states and 70222 transitions. [2019-12-18 18:05:49,097 INFO L78 Accepts]: Start accepts. Automaton has 27941 states and 70222 transitions. Word has length 98 [2019-12-18 18:05:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:49,098 INFO L462 AbstractCegarLoop]: Abstraction has 27941 states and 70222 transitions. [2019-12-18 18:05:49,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 18:05:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27941 states and 70222 transitions. [2019-12-18 18:05:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:49,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:49,126 INFO L411 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, 1, 1, 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-12-18 18:05:49,127 INFO L410 AbstractCegarLoop]: === Iteration 59 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1521203020, now seen corresponding path program 5 times [2019-12-18 18:05:49,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:49,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863411756] [2019-12-18 18:05:49,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:50,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863411756] [2019-12-18 18:05:50,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:50,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-18 18:05:50,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795512036] [2019-12-18 18:05:50,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 18:05:50,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 18:05:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-12-18 18:05:50,107 INFO L87 Difference]: Start difference. First operand 27941 states and 70222 transitions. Second operand 25 states. [2019-12-18 18:05:56,266 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-18 18:06:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:01,635 INFO L93 Difference]: Finished difference Result 42749 states and 107172 transitions. [2019-12-18 18:06:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-18 18:06:01,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 98 [2019-12-18 18:06:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:01,693 INFO L225 Difference]: With dead ends: 42749 [2019-12-18 18:06:01,693 INFO L226 Difference]: Without dead ends: 42580 [2019-12-18 18:06:01,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3438 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1222, Invalid=10120, Unknown=0, NotChecked=0, Total=11342 [2019-12-18 18:06:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42580 states. [2019-12-18 18:06:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42580 to 30635. [2019-12-18 18:06:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30635 states. [2019-12-18 18:06:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30635 states to 30635 states and 77393 transitions. [2019-12-18 18:06:02,139 INFO L78 Accepts]: Start accepts. Automaton has 30635 states and 77393 transitions. Word has length 98 [2019-12-18 18:06:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:02,139 INFO L462 AbstractCegarLoop]: Abstraction has 30635 states and 77393 transitions. [2019-12-18 18:06:02,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 18:06:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 30635 states and 77393 transitions. [2019-12-18 18:06:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:06:02,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:02,168 INFO L411 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, 1, 1, 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-12-18 18:06:02,168 INFO L410 AbstractCegarLoop]: === Iteration 60 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -299791706, now seen corresponding path program 6 times [2019-12-18 18:06:02,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:02,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473407694] [2019-12-18 18:06:02,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:02,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473407694] [2019-12-18 18:06:02,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:02,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 18:06:02,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011602315] [2019-12-18 18:06:02,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 18:06:02,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 18:06:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:06:02,978 INFO L87 Difference]: Start difference. First operand 30635 states and 77393 transitions. Second operand 23 states. Received shutdown request... [2019-12-18 18:06:17,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-18 18:06:17,973 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 18:06:17,977 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 18:06:17,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:06:17 BasicIcfg [2019-12-18 18:06:17,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:06:17,978 INFO L168 Benchmark]: Toolchain (without parser) took 221321.14 ms. Allocated memory was 140.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 104.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 18:06:17,978 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 140.5 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:06:17,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.51 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 103.8 MB in the beginning and 155.5 MB in the end (delta: -51.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:17,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.74 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 152.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:17,980 INFO L168 Benchmark]: Boogie Preprocessor took 48.06 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 149.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:17,980 INFO L168 Benchmark]: RCFGBuilder took 1165.88 ms. Allocated memory was 204.5 MB in the beginning and 234.9 MB in the end (delta: 30.4 MB). Free memory was 149.0 MB in the beginning and 188.0 MB in the end (delta: -39.0 MB). Peak memory consumption was 61.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:17,980 INFO L168 Benchmark]: TraceAbstraction took 219138.71 ms. Allocated memory was 234.9 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 186.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 18:06:17,985 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 140.5 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 882.51 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 103.8 MB in the beginning and 155.5 MB in the end (delta: -51.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.74 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 152.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.06 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 149.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1165.88 ms. Allocated memory was 204.5 MB in the beginning and 234.9 MB in the end (delta: 30.4 MB). Free memory was 149.0 MB in the beginning and 188.0 MB in the end (delta: -39.0 MB). Peak memory consumption was 61.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 219138.71 ms. Allocated memory was 234.9 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 186.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (30635states) and FLOYD_HOARE automaton (currently 105 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (60730 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (30635states) and FLOYD_HOARE automaton (currently 105 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (60730 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 218.8s, OverallIterations: 60, TraceHistogramMax: 1, AutomataDifference: 138.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 27332 SDtfs, 38103 SDslu, 157336 SDs, 0 SdLazy, 97743 SolverSat, 2086 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1622 GetRequests, 164 SyntacticMatches, 113 SemanticMatches, 1345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18035 ImplicationChecksByTransitivity, 34.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152836occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.0s AutomataMinimizationTime, 59 MinimizatonAttempts, 317157 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 5260 NumberOfCodeBlocks, 5260 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 5200 ConstructedInterpolants, 0 QuantifiedInterpolants, 2340230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 60 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown