/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:59:40,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:59:40,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:59:40,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:59:40,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:59:40,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:59:40,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:59:40,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:59:40,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:59:40,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:59:40,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:59:40,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:59:40,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:59:40,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:59:40,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:59:40,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:59:40,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:59:40,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:59:40,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:59:40,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:59:40,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:59:40,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:59:40,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:59:40,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:59:40,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:59:40,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:59:40,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:59:40,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:59:40,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:59:40,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:59:40,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:59:40,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:59:40,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:59:40,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:59:40,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:59:40,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:59:40,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:59:40,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:59:40,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:59:40,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:59:40,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:59:40,480 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-VariableLbe.epf [2019-12-18 21:59:40,494 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:59:40,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:59:40,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:59:40,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:59:40,496 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:59:40,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:59:40,497 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:59:40,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:59:40,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:59:40,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:59:40,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:59:40,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:59:40,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:59:40,498 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:59:40,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:59:40,498 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:59:40,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:59:40,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:59:40,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:59:40,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:59:40,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:59:40,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:59:40,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:59:40,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:59:40,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:59:40,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:59:40,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:59:40,501 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:59:40,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:59:40,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:59:40,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:59:40,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:59:40,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:59:40,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:59:40,811 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:59:40,812 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-18 21:59:40,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a7cedd4/b3e79da7194b4cb18facc4c1448a89e2/FLAG50ebaf715 [2019-12-18 21:59:41,430 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:59:41,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-18 21:59:41,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a7cedd4/b3e79da7194b4cb18facc4c1448a89e2/FLAG50ebaf715 [2019-12-18 21:59:41,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a7cedd4/b3e79da7194b4cb18facc4c1448a89e2 [2019-12-18 21:59:41,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:59:41,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:59:41,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:41,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:59:41,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:59:41,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700e8d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41, skipping insertion in model container [2019-12-18 21:59:41,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:59:41,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:59:42,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:42,325 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:59:42,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:42,483 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:59:42,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42 WrapperNode [2019-12-18 21:59:42,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:42,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:42,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:59:42,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:59:42,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:42,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:59:42,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:59:42,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:59:42,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (1/1) ... [2019-12-18 21:59:42,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:59:42,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:59:42,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:59:42,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:59:42,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (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 21:59:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:59:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:59:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:59:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:59:42,731 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:59:42,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:59:42,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:59:42,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:59:42,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:59:42,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:59:42,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:59:42,735 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 21:59:43,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:59:43,842 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:59:43,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:43 BoogieIcfgContainer [2019-12-18 21:59:43,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:59:43,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:59:43,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:59:43,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:59:43,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:59:41" (1/3) ... [2019-12-18 21:59:43,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc345c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:43, skipping insertion in model container [2019-12-18 21:59:43,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:42" (2/3) ... [2019-12-18 21:59:43,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc345c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:43, skipping insertion in model container [2019-12-18 21:59:43,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:43" (3/3) ... [2019-12-18 21:59:43,851 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc.i [2019-12-18 21:59:43,861 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:59:43,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:59:43,868 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:59:43,869 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:59:43,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,918 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:43,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:44,050 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:59:44,070 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:59:44,071 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:59:44,071 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:59:44,071 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:59:44,071 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:59:44,071 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:59:44,071 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:59:44,071 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:59:44,090 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 21:59:44,092 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 21:59:44,236 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 21:59:44,236 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:44,306 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 21:59:44,415 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 21:59:44,551 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 21:59:44,551 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:44,574 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 21:59:44,620 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 21:59:44,621 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:59:45,028 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-18 21:59:48,930 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:59:49,040 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:59:49,173 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-18 21:59:49,173 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-18 21:59:49,177 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-18 22:00:05,136 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-18 22:00:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-18 22:00:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:00:05,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:05,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:00:05,145 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:05,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-18 22:00:05,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:05,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469344364] [2019-12-18 22:00:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:05,424 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 22:00:05,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469344364] [2019-12-18 22:00:05,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:05,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:00:05,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844719231] [2019-12-18 22:00:05,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:00:05,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:05,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:00:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:00:05,453 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-18 22:00:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:09,045 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-18 22:00:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:00:09,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:00:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:09,778 INFO L225 Difference]: With dead ends: 120599 [2019-12-18 22:00:09,778 INFO L226 Difference]: Without dead ends: 118034 [2019-12-18 22:00:09,780 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 22:00:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-18 22:00:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-18 22:00:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-18 22:00:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-18 22:00:21,195 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-18 22:00:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:21,196 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-18 22:00:21,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:00:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-18 22:00:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:00:21,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:21,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:21,199 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:21,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-18 22:00:21,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:21,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97213745] [2019-12-18 22:00:21,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:21,298 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 22:00:21,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97213745] [2019-12-18 22:00:21,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:21,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:00:21,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608431785] [2019-12-18 22:00:21,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:00:21,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:00:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:00:21,301 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 4 states. [2019-12-18 22:00:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:22,369 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-18 22:00:22,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:00:22,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:00:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:27,394 INFO L225 Difference]: With dead ends: 156706 [2019-12-18 22:00:27,395 INFO L226 Difference]: Without dead ends: 156706 [2019-12-18 22:00:27,395 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 22:00:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-18 22:00:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-18 22:00:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-18 22:00:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-18 22:00:41,486 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-18 22:00:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:41,486 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-18 22:00:41,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:00:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-18 22:00:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:00:41,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:41,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:41,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-18 22:00:41,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:41,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445854221] [2019-12-18 22:00:41,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:41,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445854221] [2019-12-18 22:00:41,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:41,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:00:41,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033237159] [2019-12-18 22:00:41,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:00:41,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:41,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:00:41,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:00:41,579 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-18 22:00:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:42,822 INFO L93 Difference]: Finished difference Result 203727 states and 733867 transitions. [2019-12-18 22:00:42,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:00:42,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:00:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:44,667 INFO L225 Difference]: With dead ends: 203727 [2019-12-18 22:00:44,668 INFO L226 Difference]: Without dead ends: 203727 [2019-12-18 22:00:44,668 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 22:00:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203727 states. [2019-12-18 22:01:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203727 to 189697. [2019-12-18 22:01:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189697 states. [2019-12-18 22:01:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189697 states to 189697 states and 685577 transitions. [2019-12-18 22:01:03,502 INFO L78 Accepts]: Start accepts. Automaton has 189697 states and 685577 transitions. Word has length 11 [2019-12-18 22:01:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:03,503 INFO L462 AbstractCegarLoop]: Abstraction has 189697 states and 685577 transitions. [2019-12-18 22:01:03,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:01:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 189697 states and 685577 transitions. [2019-12-18 22:01:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:01:03,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:03,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:01:03,510 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1176638523, now seen corresponding path program 1 times [2019-12-18 22:01:03,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:03,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292685320] [2019-12-18 22:01:03,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:03,589 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 22:01:03,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292685320] [2019-12-18 22:01:03,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:03,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:01:03,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678439314] [2019-12-18 22:01:03,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:03,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:03,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:03,593 INFO L87 Difference]: Start difference. First operand 189697 states and 685577 transitions. Second operand 5 states. [2019-12-18 22:01:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:06,163 INFO L93 Difference]: Finished difference Result 251197 states and 891926 transitions. [2019-12-18 22:01:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:01:06,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 22:01:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:06,746 INFO L225 Difference]: With dead ends: 251197 [2019-12-18 22:01:06,746 INFO L226 Difference]: Without dead ends: 251197 [2019-12-18 22:01:06,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:01:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251197 states. [2019-12-18 22:01:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251197 to 188159. [2019-12-18 22:01:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188159 states. [2019-12-18 22:01:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188159 states to 188159 states and 679985 transitions. [2019-12-18 22:01:24,194 INFO L78 Accepts]: Start accepts. Automaton has 188159 states and 679985 transitions. Word has length 17 [2019-12-18 22:01:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:24,194 INFO L462 AbstractCegarLoop]: Abstraction has 188159 states and 679985 transitions. [2019-12-18 22:01:24,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 188159 states and 679985 transitions. [2019-12-18 22:01:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:01:24,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:24,221 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 22:01:24,221 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:24,222 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-18 22:01:24,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:24,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139212079] [2019-12-18 22:01:24,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:24,365 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 22:01:24,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139212079] [2019-12-18 22:01:24,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:24,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:01:24,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879134116] [2019-12-18 22:01:24,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:01:24,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:01:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:24,368 INFO L87 Difference]: Start difference. First operand 188159 states and 679985 transitions. Second operand 6 states. [2019-12-18 22:01:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:31,053 INFO L93 Difference]: Finished difference Result 258327 states and 918716 transitions. [2019-12-18 22:01:31,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:01:31,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 22:01:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:31,627 INFO L225 Difference]: With dead ends: 258327 [2019-12-18 22:01:31,627 INFO L226 Difference]: Without dead ends: 258327 [2019-12-18 22:01:31,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:01:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258327 states. [2019-12-18 22:01:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258327 to 243454. [2019-12-18 22:01:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243454 states. [2019-12-18 22:01:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243454 states to 243454 states and 868009 transitions. [2019-12-18 22:01:44,953 INFO L78 Accepts]: Start accepts. Automaton has 243454 states and 868009 transitions. Word has length 25 [2019-12-18 22:01:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:44,955 INFO L462 AbstractCegarLoop]: Abstraction has 243454 states and 868009 transitions. [2019-12-18 22:01:44,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:01:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 243454 states and 868009 transitions. [2019-12-18 22:01:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:01:44,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:44,977 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 22:01:44,977 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:44,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:44,978 INFO L82 PathProgramCache]: Analyzing trace with hash 144894900, now seen corresponding path program 1 times [2019-12-18 22:01:44,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:44,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945476918] [2019-12-18 22:01:44,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:45,050 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 22:01:45,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945476918] [2019-12-18 22:01:45,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:45,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:01:45,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721543296] [2019-12-18 22:01:45,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:01:45,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:45,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:01:45,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:01:45,053 INFO L87 Difference]: Start difference. First operand 243454 states and 868009 transitions. Second operand 4 states. [2019-12-18 22:01:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:45,120 INFO L93 Difference]: Finished difference Result 14903 states and 40512 transitions. [2019-12-18 22:01:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:01:45,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:01:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:45,132 INFO L225 Difference]: With dead ends: 14903 [2019-12-18 22:01:45,135 INFO L226 Difference]: Without dead ends: 10760 [2019-12-18 22:01:45,136 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 22:01:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10760 states. [2019-12-18 22:01:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10760 to 10720. [2019-12-18 22:01:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10720 states. [2019-12-18 22:01:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 26331 transitions. [2019-12-18 22:01:45,272 INFO L78 Accepts]: Start accepts. Automaton has 10720 states and 26331 transitions. Word has length 25 [2019-12-18 22:01:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:45,272 INFO L462 AbstractCegarLoop]: Abstraction has 10720 states and 26331 transitions. [2019-12-18 22:01:45,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:01:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 10720 states and 26331 transitions. [2019-12-18 22:01:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 22:01:45,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:45,276 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 22:01:45,277 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-18 22:01:45,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:45,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28872363] [2019-12-18 22:01:45,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:45,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 22:01:45,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28872363] [2019-12-18 22:01:45,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:45,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:01:45,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975594732] [2019-12-18 22:01:45,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:01:45,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:01:45,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:45,365 INFO L87 Difference]: Start difference. First operand 10720 states and 26331 transitions. Second operand 6 states. [2019-12-18 22:01:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:46,755 INFO L93 Difference]: Finished difference Result 12029 states and 29137 transitions. [2019-12-18 22:01:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:01:46,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 22:01:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:46,770 INFO L225 Difference]: With dead ends: 12029 [2019-12-18 22:01:46,771 INFO L226 Difference]: Without dead ends: 11981 [2019-12-18 22:01:46,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 22:01:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2019-12-18 22:01:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 11601. [2019-12-18 22:01:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-12-18 22:01:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 28281 transitions. [2019-12-18 22:01:46,906 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 28281 transitions. Word has length 38 [2019-12-18 22:01:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:46,907 INFO L462 AbstractCegarLoop]: Abstraction has 11601 states and 28281 transitions. [2019-12-18 22:01:46,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:01:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 28281 transitions. [2019-12-18 22:01:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 22:01:46,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:46,913 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 22:01:46,914 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-18 22:01:46,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:46,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670617253] [2019-12-18 22:01:46,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:47,002 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 22:01:47,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670617253] [2019-12-18 22:01:47,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:47,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:01:47,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239158189] [2019-12-18 22:01:47,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:47,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:47,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:47,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:47,004 INFO L87 Difference]: Start difference. First operand 11601 states and 28281 transitions. Second operand 5 states. [2019-12-18 22:01:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:47,065 INFO L93 Difference]: Finished difference Result 4851 states and 11487 transitions. [2019-12-18 22:01:47,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:01:47,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-18 22:01:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:47,072 INFO L225 Difference]: With dead ends: 4851 [2019-12-18 22:01:47,072 INFO L226 Difference]: Without dead ends: 4662 [2019-12-18 22:01:47,073 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 22:01:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states. [2019-12-18 22:01:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 4594. [2019-12-18 22:01:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2019-12-18 22:01:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 10947 transitions. [2019-12-18 22:01:47,136 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 10947 transitions. Word has length 50 [2019-12-18 22:01:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:47,137 INFO L462 AbstractCegarLoop]: Abstraction has 4594 states and 10947 transitions. [2019-12-18 22:01:47,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 10947 transitions. [2019-12-18 22:01:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:01:47,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:47,144 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 22:01:47,144 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1979048117, now seen corresponding path program 1 times [2019-12-18 22:01:47,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:47,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083700273] [2019-12-18 22:01:47,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:47,305 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 22:01:47,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083700273] [2019-12-18 22:01:47,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:47,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:01:47,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392757563] [2019-12-18 22:01:47,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:01:47,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:01:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:47,307 INFO L87 Difference]: Start difference. First operand 4594 states and 10947 transitions. Second operand 6 states. [2019-12-18 22:01:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:48,134 INFO L93 Difference]: Finished difference Result 6219 states and 14630 transitions. [2019-12-18 22:01:48,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:01:48,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 22:01:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:48,143 INFO L225 Difference]: With dead ends: 6219 [2019-12-18 22:01:48,143 INFO L226 Difference]: Without dead ends: 6219 [2019-12-18 22:01:48,144 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 22:01:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2019-12-18 22:01:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 5884. [2019-12-18 22:01:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5884 states. [2019-12-18 22:01:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5884 states to 5884 states and 13909 transitions. [2019-12-18 22:01:48,209 INFO L78 Accepts]: Start accepts. Automaton has 5884 states and 13909 transitions. Word has length 94 [2019-12-18 22:01:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:48,209 INFO L462 AbstractCegarLoop]: Abstraction has 5884 states and 13909 transitions. [2019-12-18 22:01:48,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:01:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5884 states and 13909 transitions. [2019-12-18 22:01:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:01:48,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:48,218 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 22:01:48,218 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:48,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash 275007721, now seen corresponding path program 2 times [2019-12-18 22:01:48,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:48,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422067815] [2019-12-18 22:01:48,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:48,336 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 22:01:48,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422067815] [2019-12-18 22:01:48,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:48,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:01:48,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366958854] [2019-12-18 22:01:48,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:01:48,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:01:48,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:01:48,338 INFO L87 Difference]: Start difference. First operand 5884 states and 13909 transitions. Second operand 7 states. [2019-12-18 22:01:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:49,347 INFO L93 Difference]: Finished difference Result 7026 states and 16461 transitions. [2019-12-18 22:01:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:01:49,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 22:01:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:49,357 INFO L225 Difference]: With dead ends: 7026 [2019-12-18 22:01:49,357 INFO L226 Difference]: Without dead ends: 7026 [2019-12-18 22:01:49,358 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 22:01:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2019-12-18 22:01:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 6301. [2019-12-18 22:01:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6301 states. [2019-12-18 22:01:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6301 states to 6301 states and 14857 transitions. [2019-12-18 22:01:49,435 INFO L78 Accepts]: Start accepts. Automaton has 6301 states and 14857 transitions. Word has length 94 [2019-12-18 22:01:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:49,435 INFO L462 AbstractCegarLoop]: Abstraction has 6301 states and 14857 transitions. [2019-12-18 22:01:49,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:01:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6301 states and 14857 transitions. [2019-12-18 22:01:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:01:49,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:49,444 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 22:01:49,444 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash -860704691, now seen corresponding path program 3 times [2019-12-18 22:01:49,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:49,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474538706] [2019-12-18 22:01:49,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:49,562 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 22:01:49,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474538706] [2019-12-18 22:01:49,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:49,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:01:49,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969847099] [2019-12-18 22:01:49,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:49,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:49,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:49,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:49,565 INFO L87 Difference]: Start difference. First operand 6301 states and 14857 transitions. Second operand 5 states. [2019-12-18 22:01:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:50,121 INFO L93 Difference]: Finished difference Result 6796 states and 15880 transitions. [2019-12-18 22:01:50,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:01:50,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 22:01:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:50,131 INFO L225 Difference]: With dead ends: 6796 [2019-12-18 22:01:50,131 INFO L226 Difference]: Without dead ends: 6796 [2019-12-18 22:01:50,131 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 22:01:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6796 states. [2019-12-18 22:01:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6796 to 6361. [2019-12-18 22:01:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2019-12-18 22:01:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15003 transitions. [2019-12-18 22:01:50,203 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15003 transitions. Word has length 94 [2019-12-18 22:01:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:50,203 INFO L462 AbstractCegarLoop]: Abstraction has 6361 states and 15003 transitions. [2019-12-18 22:01:50,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15003 transitions. [2019-12-18 22:01:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:01:50,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:50,213 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 22:01:50,213 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1714542913, now seen corresponding path program 4 times [2019-12-18 22:01:50,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:50,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455480929] [2019-12-18 22:01:50,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:50,342 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 22:01:50,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455480929] [2019-12-18 22:01:50,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:50,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:01:50,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741893958] [2019-12-18 22:01:50,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:01:50,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:01:50,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:50,482 INFO L87 Difference]: Start difference. First operand 6361 states and 15003 transitions. Second operand 6 states. [2019-12-18 22:01:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:51,243 INFO L93 Difference]: Finished difference Result 7049 states and 16408 transitions. [2019-12-18 22:01:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:01:51,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 22:01:51,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:51,254 INFO L225 Difference]: With dead ends: 7049 [2019-12-18 22:01:51,254 INFO L226 Difference]: Without dead ends: 7049 [2019-12-18 22:01:51,254 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 22:01:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7049 states. [2019-12-18 22:01:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7049 to 6772. [2019-12-18 22:01:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6772 states. [2019-12-18 22:01:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6772 states to 6772 states and 15869 transitions. [2019-12-18 22:01:51,415 INFO L78 Accepts]: Start accepts. Automaton has 6772 states and 15869 transitions. Word has length 94 [2019-12-18 22:01:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:51,415 INFO L462 AbstractCegarLoop]: Abstraction has 6772 states and 15869 transitions. [2019-12-18 22:01:51,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:01:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6772 states and 15869 transitions. [2019-12-18 22:01:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:01:51,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:51,432 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 22:01:51,432 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1745018821, now seen corresponding path program 5 times [2019-12-18 22:01:51,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:51,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52136240] [2019-12-18 22:01:51,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:51,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 22:01:51,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52136240] [2019-12-18 22:01:51,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:51,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:01:51,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467491404] [2019-12-18 22:01:51,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:01:51,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:01:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:01:51,540 INFO L87 Difference]: Start difference. First operand 6772 states and 15869 transitions. Second operand 3 states. [2019-12-18 22:01:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:51,629 INFO L93 Difference]: Finished difference Result 6772 states and 15868 transitions. [2019-12-18 22:01:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:01:51,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 22:01:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:51,641 INFO L225 Difference]: With dead ends: 6772 [2019-12-18 22:01:51,641 INFO L226 Difference]: Without dead ends: 6772 [2019-12-18 22:01:51,642 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 22:01:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6772 states. [2019-12-18 22:01:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6772 to 6255. [2019-12-18 22:01:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6255 states. [2019-12-18 22:01:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 14814 transitions. [2019-12-18 22:01:51,783 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 14814 transitions. Word has length 94 [2019-12-18 22:01:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:51,784 INFO L462 AbstractCegarLoop]: Abstraction has 6255 states and 14814 transitions. [2019-12-18 22:01:51,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:01:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 14814 transitions. [2019-12-18 22:01:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:01:51,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:51,804 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 22:01:51,805 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:51,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash 874014353, now seen corresponding path program 1 times [2019-12-18 22:01:51,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:51,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188788717] [2019-12-18 22:01:51,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:52,095 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 22:01:52,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188788717] [2019-12-18 22:01:52,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:52,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:01:52,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43034187] [2019-12-18 22:01:52,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:01:52,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:52,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:01:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:01:52,099 INFO L87 Difference]: Start difference. First operand 6255 states and 14814 transitions. Second operand 9 states. [2019-12-18 22:01:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:52,961 INFO L93 Difference]: Finished difference Result 11179 states and 26236 transitions. [2019-12-18 22:01:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:01:52,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-18 22:01:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:52,973 INFO L225 Difference]: With dead ends: 11179 [2019-12-18 22:01:52,973 INFO L226 Difference]: Without dead ends: 9127 [2019-12-18 22:01:52,974 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 22:01:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2019-12-18 22:01:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 7582. [2019-12-18 22:01:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7582 states. [2019-12-18 22:01:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 18124 transitions. [2019-12-18 22:01:53,061 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 18124 transitions. Word has length 95 [2019-12-18 22:01:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:53,061 INFO L462 AbstractCegarLoop]: Abstraction has 7582 states and 18124 transitions. [2019-12-18 22:01:53,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:01:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 18124 transitions. [2019-12-18 22:01:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:01:53,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:53,069 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 22:01:53,069 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:53,069 INFO L82 PathProgramCache]: Analyzing trace with hash -510698891, now seen corresponding path program 2 times [2019-12-18 22:01:53,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:53,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485068428] [2019-12-18 22:01:53,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:53,248 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 22:01:53,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485068428] [2019-12-18 22:01:53,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:53,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:01:53,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747360355] [2019-12-18 22:01:53,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:01:53,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:01:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:01:53,251 INFO L87 Difference]: Start difference. First operand 7582 states and 18124 transitions. Second operand 10 states. [2019-12-18 22:01:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:54,269 INFO L93 Difference]: Finished difference Result 12558 states and 29764 transitions. [2019-12-18 22:01:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:01:54,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-18 22:01:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:54,284 INFO L225 Difference]: With dead ends: 12558 [2019-12-18 22:01:54,284 INFO L226 Difference]: Without dead ends: 11092 [2019-12-18 22:01:54,285 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 22:01:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11092 states. [2019-12-18 22:01:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11092 to 7751. [2019-12-18 22:01:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7751 states. [2019-12-18 22:01:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7751 states to 7751 states and 18512 transitions. [2019-12-18 22:01:54,390 INFO L78 Accepts]: Start accepts. Automaton has 7751 states and 18512 transitions. Word has length 95 [2019-12-18 22:01:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:54,390 INFO L462 AbstractCegarLoop]: Abstraction has 7751 states and 18512 transitions. [2019-12-18 22:01:54,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:01:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 7751 states and 18512 transitions. [2019-12-18 22:01:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:01:54,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:54,400 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 22:01:54,400 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash 800944117, now seen corresponding path program 3 times [2019-12-18 22:01:54,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:54,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099734289] [2019-12-18 22:01:54,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:54,463 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 22:01:54,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099734289] [2019-12-18 22:01:54,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:54,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:01:54,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466063994] [2019-12-18 22:01:54,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:01:54,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:54,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:01:54,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:01:54,465 INFO L87 Difference]: Start difference. First operand 7751 states and 18512 transitions. Second operand 3 states. [2019-12-18 22:01:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:54,522 INFO L93 Difference]: Finished difference Result 5323 states and 12618 transitions. [2019-12-18 22:01:54,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:01:54,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-18 22:01:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:54,530 INFO L225 Difference]: With dead ends: 5323 [2019-12-18 22:01:54,530 INFO L226 Difference]: Without dead ends: 5323 [2019-12-18 22:01:54,530 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 22:01:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2019-12-18 22:01:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5311. [2019-12-18 22:01:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-12-18 22:01:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 12596 transitions. [2019-12-18 22:01:54,615 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 12596 transitions. Word has length 95 [2019-12-18 22:01:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:54,616 INFO L462 AbstractCegarLoop]: Abstraction has 5311 states and 12596 transitions. [2019-12-18 22:01:54,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:01:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 12596 transitions. [2019-12-18 22:01:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:01:54,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:54,623 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 22:01:54,623 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1655863600, now seen corresponding path program 1 times [2019-12-18 22:01:54,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:54,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844007939] [2019-12-18 22:01:54,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:54,709 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 22:01:54,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844007939] [2019-12-18 22:01:54,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:54,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:01:54,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599873609] [2019-12-18 22:01:54,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:01:54,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:54,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:01:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:54,711 INFO L87 Difference]: Start difference. First operand 5311 states and 12596 transitions. Second operand 6 states. [2019-12-18 22:01:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:55,547 INFO L93 Difference]: Finished difference Result 5689 states and 13340 transitions. [2019-12-18 22:01:55,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:01:55,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 22:01:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:55,555 INFO L225 Difference]: With dead ends: 5689 [2019-12-18 22:01:55,555 INFO L226 Difference]: Without dead ends: 5689 [2019-12-18 22:01:55,556 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 22:01:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5689 states. [2019-12-18 22:01:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5689 to 5215. [2019-12-18 22:01:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2019-12-18 22:01:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 12402 transitions. [2019-12-18 22:01:55,620 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 12402 transitions. Word has length 96 [2019-12-18 22:01:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:55,621 INFO L462 AbstractCegarLoop]: Abstraction has 5215 states and 12402 transitions. [2019-12-18 22:01:55,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:01:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 12402 transitions. [2019-12-18 22:01:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:01:55,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:55,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 22:01:55,627 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1106579360, now seen corresponding path program 2 times [2019-12-18 22:01:55,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:55,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069549834] [2019-12-18 22:01:55,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:55,704 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 22:01:55,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069549834] [2019-12-18 22:01:55,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:55,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:01:55,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938317607] [2019-12-18 22:01:55,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:01:55,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:01:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:01:55,706 INFO L87 Difference]: Start difference. First operand 5215 states and 12402 transitions. Second operand 4 states. [2019-12-18 22:01:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:55,983 INFO L93 Difference]: Finished difference Result 6244 states and 14837 transitions. [2019-12-18 22:01:55,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:01:55,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-18 22:01:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:55,992 INFO L225 Difference]: With dead ends: 6244 [2019-12-18 22:01:55,992 INFO L226 Difference]: Without dead ends: 6244 [2019-12-18 22:01:55,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 22:01:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6244 states. [2019-12-18 22:01:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6244 to 6079. [2019-12-18 22:01:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6079 states. [2019-12-18 22:01:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6079 states to 6079 states and 14468 transitions. [2019-12-18 22:01:56,061 INFO L78 Accepts]: Start accepts. Automaton has 6079 states and 14468 transitions. Word has length 96 [2019-12-18 22:01:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:56,061 INFO L462 AbstractCegarLoop]: Abstraction has 6079 states and 14468 transitions. [2019-12-18 22:01:56,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:01:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 6079 states and 14468 transitions. [2019-12-18 22:01:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:01:56,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:56,067 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 22:01:56,067 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash -119254624, now seen corresponding path program 3 times [2019-12-18 22:01:56,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:56,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593156766] [2019-12-18 22:01:56,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:56,177 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 22:01:56,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593156766] [2019-12-18 22:01:56,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:56,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:01:56,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128454614] [2019-12-18 22:01:56,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:01:56,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:01:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:56,179 INFO L87 Difference]: Start difference. First operand 6079 states and 14468 transitions. Second operand 6 states. [2019-12-18 22:01:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:56,320 INFO L93 Difference]: Finished difference Result 7331 states and 17187 transitions. [2019-12-18 22:01:56,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:01:56,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 22:01:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:56,328 INFO L225 Difference]: With dead ends: 7331 [2019-12-18 22:01:56,329 INFO L226 Difference]: Without dead ends: 6424 [2019-12-18 22:01:56,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 22:01:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6424 states. [2019-12-18 22:01:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6424 to 6364. [2019-12-18 22:01:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6364 states. [2019-12-18 22:01:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 15151 transitions. [2019-12-18 22:01:56,400 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 15151 transitions. Word has length 96 [2019-12-18 22:01:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:56,401 INFO L462 AbstractCegarLoop]: Abstraction has 6364 states and 15151 transitions. [2019-12-18 22:01:56,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:01:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 15151 transitions. [2019-12-18 22:01:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:01:56,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:56,408 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 22:01:56,408 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash -882944868, now seen corresponding path program 4 times [2019-12-18 22:01:56,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:56,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153367439] [2019-12-18 22:01:56,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:56,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 22:01:56,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153367439] [2019-12-18 22:01:56,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:56,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:01:56,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539137032] [2019-12-18 22:01:56,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:01:56,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:01:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:01:56,641 INFO L87 Difference]: Start difference. First operand 6364 states and 15151 transitions. Second operand 12 states. [2019-12-18 22:01:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:58,120 INFO L93 Difference]: Finished difference Result 12645 states and 30270 transitions. [2019-12-18 22:01:58,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:01:58,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 22:01:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:58,136 INFO L225 Difference]: With dead ends: 12645 [2019-12-18 22:01:58,136 INFO L226 Difference]: Without dead ends: 12187 [2019-12-18 22:01:58,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:01:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12187 states. [2019-12-18 22:01:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12187 to 8899. [2019-12-18 22:01:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8899 states. [2019-12-18 22:01:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8899 states to 8899 states and 21687 transitions. [2019-12-18 22:01:58,268 INFO L78 Accepts]: Start accepts. Automaton has 8899 states and 21687 transitions. Word has length 96 [2019-12-18 22:01:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:58,269 INFO L462 AbstractCegarLoop]: Abstraction has 8899 states and 21687 transitions. [2019-12-18 22:01:58,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:01:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 8899 states and 21687 transitions. [2019-12-18 22:01:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:01:58,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:58,282 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 22:01:58,282 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:58,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash -869322052, now seen corresponding path program 5 times [2019-12-18 22:01:58,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:58,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895495095] [2019-12-18 22:01:58,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:58,387 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 22:01:58,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895495095] [2019-12-18 22:01:58,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:58,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:01:58,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763269041] [2019-12-18 22:01:58,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:58,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:58,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:58,389 INFO L87 Difference]: Start difference. First operand 8899 states and 21687 transitions. Second operand 5 states. [2019-12-18 22:01:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:58,973 INFO L93 Difference]: Finished difference Result 11035 states and 26912 transitions. [2019-12-18 22:01:58,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:01:58,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-18 22:01:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:58,987 INFO L225 Difference]: With dead ends: 11035 [2019-12-18 22:01:58,987 INFO L226 Difference]: Without dead ends: 11035 [2019-12-18 22:01:58,989 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 22:01:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11035 states. [2019-12-18 22:01:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11035 to 9786. [2019-12-18 22:01:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9786 states. [2019-12-18 22:01:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9786 states to 9786 states and 23936 transitions. [2019-12-18 22:01:59,247 INFO L78 Accepts]: Start accepts. Automaton has 9786 states and 23936 transitions. Word has length 96 [2019-12-18 22:01:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:59,248 INFO L462 AbstractCegarLoop]: Abstraction has 9786 states and 23936 transitions. [2019-12-18 22:01:59,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9786 states and 23936 transitions. [2019-12-18 22:01:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:01:59,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:59,278 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 22:01:59,278 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2008375454, now seen corresponding path program 6 times [2019-12-18 22:01:59,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:59,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905974139] [2019-12-18 22:01:59,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:59,436 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 22:01:59,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905974139] [2019-12-18 22:01:59,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:59,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:01:59,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756047585] [2019-12-18 22:01:59,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:01:59,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:59,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:01:59,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:01:59,438 INFO L87 Difference]: Start difference. First operand 9786 states and 23936 transitions. Second operand 10 states. [2019-12-18 22:02:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:00,389 INFO L93 Difference]: Finished difference Result 18333 states and 44414 transitions. [2019-12-18 22:02:00,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:02:00,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:02:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:00,410 INFO L225 Difference]: With dead ends: 18333 [2019-12-18 22:02:00,410 INFO L226 Difference]: Without dead ends: 17236 [2019-12-18 22:02:00,410 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 22:02:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17236 states. [2019-12-18 22:02:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17236 to 12872. [2019-12-18 22:02:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12872 states. [2019-12-18 22:02:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12872 states to 12872 states and 32192 transitions. [2019-12-18 22:02:00,607 INFO L78 Accepts]: Start accepts. Automaton has 12872 states and 32192 transitions. Word has length 96 [2019-12-18 22:02:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:00,607 INFO L462 AbstractCegarLoop]: Abstraction has 12872 states and 32192 transitions. [2019-12-18 22:02:00,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 12872 states and 32192 transitions. [2019-12-18 22:02:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:00,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:00,625 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 22:02:00,626 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash 220995342, now seen corresponding path program 7 times [2019-12-18 22:02:00,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:00,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503692709] [2019-12-18 22:02:00,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:00,715 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 22:02:00,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503692709] [2019-12-18 22:02:00,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:00,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:02:00,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403399200] [2019-12-18 22:02:00,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:02:00,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:00,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:02:00,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:00,717 INFO L87 Difference]: Start difference. First operand 12872 states and 32192 transitions. Second operand 6 states. [2019-12-18 22:02:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:01,161 INFO L93 Difference]: Finished difference Result 14991 states and 37250 transitions. [2019-12-18 22:02:01,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:02:01,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 22:02:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:01,179 INFO L225 Difference]: With dead ends: 14991 [2019-12-18 22:02:01,180 INFO L226 Difference]: Without dead ends: 14991 [2019-12-18 22:02:01,180 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 22:02:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14991 states. [2019-12-18 22:02:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14991 to 12893. [2019-12-18 22:02:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12893 states. [2019-12-18 22:02:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12893 states to 12893 states and 32241 transitions. [2019-12-18 22:02:01,356 INFO L78 Accepts]: Start accepts. Automaton has 12893 states and 32241 transitions. Word has length 96 [2019-12-18 22:02:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:01,356 INFO L462 AbstractCegarLoop]: Abstraction has 12893 states and 32241 transitions. [2019-12-18 22:02:01,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:02:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 12893 states and 32241 transitions. [2019-12-18 22:02:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:01,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:01,370 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 22:02:01,370 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash 426582246, now seen corresponding path program 8 times [2019-12-18 22:02:01,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:01,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367700202] [2019-12-18 22:02:01,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:01,645 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 22:02:01,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367700202] [2019-12-18 22:02:01,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:01,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:02:01,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951486234] [2019-12-18 22:02:01,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:02:01,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:01,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:02:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:02:01,649 INFO L87 Difference]: Start difference. First operand 12893 states and 32241 transitions. Second operand 14 states. [2019-12-18 22:02:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:02,792 INFO L93 Difference]: Finished difference Result 18005 states and 44237 transitions. [2019-12-18 22:02:02,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:02:02,792 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 22:02:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:02,816 INFO L225 Difference]: With dead ends: 18005 [2019-12-18 22:02:02,816 INFO L226 Difference]: Without dead ends: 17976 [2019-12-18 22:02:02,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:02:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17976 states. [2019-12-18 22:02:03,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17976 to 15622. [2019-12-18 22:02:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15622 states. [2019-12-18 22:02:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15622 states to 15622 states and 39037 transitions. [2019-12-18 22:02:03,170 INFO L78 Accepts]: Start accepts. Automaton has 15622 states and 39037 transitions. Word has length 96 [2019-12-18 22:02:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:03,170 INFO L462 AbstractCegarLoop]: Abstraction has 15622 states and 39037 transitions. [2019-12-18 22:02:03,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:02:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 15622 states and 39037 transitions. [2019-12-18 22:02:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:03,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:03,186 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 22:02:03,186 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1389615966, now seen corresponding path program 9 times [2019-12-18 22:02:03,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:03,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778601075] [2019-12-18 22:02:03,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:03,328 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 22:02:03,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778601075] [2019-12-18 22:02:03,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:03,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:03,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920454754] [2019-12-18 22:02:03,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:03,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:03,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:03,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:03,330 INFO L87 Difference]: Start difference. First operand 15622 states and 39037 transitions. Second operand 10 states. [2019-12-18 22:02:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:04,307 INFO L93 Difference]: Finished difference Result 26982 states and 65799 transitions. [2019-12-18 22:02:04,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:02:04,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:02:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:04,339 INFO L225 Difference]: With dead ends: 26982 [2019-12-18 22:02:04,339 INFO L226 Difference]: Without dead ends: 25755 [2019-12-18 22:02:04,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25755 states. [2019-12-18 22:02:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25755 to 19374. [2019-12-18 22:02:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-12-18 22:02:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 48827 transitions. [2019-12-18 22:02:04,647 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 48827 transitions. Word has length 96 [2019-12-18 22:02:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:04,647 INFO L462 AbstractCegarLoop]: Abstraction has 19374 states and 48827 transitions. [2019-12-18 22:02:04,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 48827 transitions. [2019-12-18 22:02:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:04,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02: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] [2019-12-18 22:02:04,668 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash -692622050, now seen corresponding path program 10 times [2019-12-18 22:02:04,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:04,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071172103] [2019-12-18 22:02:04,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:04,910 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 22:02:04,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071172103] [2019-12-18 22:02:04,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:04,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:02:04,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073706109] [2019-12-18 22:02:04,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:04,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:04,913 INFO L87 Difference]: Start difference. First operand 19374 states and 48827 transitions. Second operand 10 states. [2019-12-18 22:02:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:06,394 INFO L93 Difference]: Finished difference Result 27228 states and 68222 transitions. [2019-12-18 22:02:06,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:02:06,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:02:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:06,435 INFO L225 Difference]: With dead ends: 27228 [2019-12-18 22:02:06,435 INFO L226 Difference]: Without dead ends: 27222 [2019-12-18 22:02:06,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:02:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27222 states. [2019-12-18 22:02:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27222 to 21415. [2019-12-18 22:02:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21415 states. [2019-12-18 22:02:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21415 states to 21415 states and 54034 transitions. [2019-12-18 22:02:06,920 INFO L78 Accepts]: Start accepts. Automaton has 21415 states and 54034 transitions. Word has length 96 [2019-12-18 22:02:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:06,920 INFO L462 AbstractCegarLoop]: Abstraction has 21415 states and 54034 transitions. [2019-12-18 22:02:06,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 21415 states and 54034 transitions. [2019-12-18 22:02:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:06,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:06,943 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 22:02:06,943 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1013345872, now seen corresponding path program 11 times [2019-12-18 22:02:06,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:06,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296218367] [2019-12-18 22:02:06,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:07,141 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 22:02:07,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296218367] [2019-12-18 22:02:07,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:07,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:02:07,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998718266] [2019-12-18 22:02:07,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:07,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:07,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:07,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:07,143 INFO L87 Difference]: Start difference. First operand 21415 states and 54034 transitions. Second operand 11 states. [2019-12-18 22:02:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:08,902 INFO L93 Difference]: Finished difference Result 35379 states and 87038 transitions. [2019-12-18 22:02:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 22:02:08,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 22:02:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:08,943 INFO L225 Difference]: With dead ends: 35379 [2019-12-18 22:02:08,943 INFO L226 Difference]: Without dead ends: 33475 [2019-12-18 22:02:08,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=335, Invalid=1471, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 22:02:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33475 states. [2019-12-18 22:02:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33475 to 26777. [2019-12-18 22:02:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26777 states. [2019-12-18 22:02:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26777 states to 26777 states and 67847 transitions. [2019-12-18 22:02:09,347 INFO L78 Accepts]: Start accepts. Automaton has 26777 states and 67847 transitions. Word has length 96 [2019-12-18 22:02:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:09,347 INFO L462 AbstractCegarLoop]: Abstraction has 26777 states and 67847 transitions. [2019-12-18 22:02:09,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 26777 states and 67847 transitions. [2019-12-18 22:02:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:09,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:09,372 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 22:02:09,372 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash -367874500, now seen corresponding path program 12 times [2019-12-18 22:02:09,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:09,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417117067] [2019-12-18 22:02:09,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:09,518 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 22:02:09,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417117067] [2019-12-18 22:02:09,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:09,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:09,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749582158] [2019-12-18 22:02:09,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:09,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:09,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:09,520 INFO L87 Difference]: Start difference. First operand 26777 states and 67847 transitions. Second operand 10 states. [2019-12-18 22:02:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:10,796 INFO L93 Difference]: Finished difference Result 38649 states and 96053 transitions. [2019-12-18 22:02:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:02:10,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:02:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:10,840 INFO L225 Difference]: With dead ends: 38649 [2019-12-18 22:02:10,840 INFO L226 Difference]: Without dead ends: 38089 [2019-12-18 22:02:10,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:02:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38089 states. [2019-12-18 22:02:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38089 to 27013. [2019-12-18 22:02:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27013 states. [2019-12-18 22:02:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27013 states to 27013 states and 68345 transitions. [2019-12-18 22:02:11,233 INFO L78 Accepts]: Start accepts. Automaton has 27013 states and 68345 transitions. Word has length 96 [2019-12-18 22:02:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:11,234 INFO L462 AbstractCegarLoop]: Abstraction has 27013 states and 68345 transitions. [2019-12-18 22:02:11,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27013 states and 68345 transitions. [2019-12-18 22:02:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:11,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:11,259 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 22:02:11,259 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1842055418, now seen corresponding path program 13 times [2019-12-18 22:02:11,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:11,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693448328] [2019-12-18 22:02:11,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:11,407 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 22:02:11,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693448328] [2019-12-18 22:02:11,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:11,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:02:11,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073583625] [2019-12-18 22:02:11,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:11,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:11,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:11,409 INFO L87 Difference]: Start difference. First operand 27013 states and 68345 transitions. Second operand 10 states. [2019-12-18 22:02:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:12,066 INFO L93 Difference]: Finished difference Result 39720 states and 99770 transitions. [2019-12-18 22:02:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:02:12,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:02:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:12,110 INFO L225 Difference]: With dead ends: 39720 [2019-12-18 22:02:12,110 INFO L226 Difference]: Without dead ends: 35731 [2019-12-18 22:02:12,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:02:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35731 states. [2019-12-18 22:02:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35731 to 29651. [2019-12-18 22:02:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29651 states. [2019-12-18 22:02:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29651 states to 29651 states and 75225 transitions. [2019-12-18 22:02:12,515 INFO L78 Accepts]: Start accepts. Automaton has 29651 states and 75225 transitions. Word has length 96 [2019-12-18 22:02:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:12,516 INFO L462 AbstractCegarLoop]: Abstraction has 29651 states and 75225 transitions. [2019-12-18 22:02:12,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29651 states and 75225 transitions. [2019-12-18 22:02:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:12,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:12,547 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 22:02:12,547 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash -667449880, now seen corresponding path program 14 times [2019-12-18 22:02:12,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:12,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440268038] [2019-12-18 22:02:12,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:12,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440268038] [2019-12-18 22:02:12,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:12,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:02:12,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46990829] [2019-12-18 22:02:12,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:02:12,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:02:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:12,970 INFO L87 Difference]: Start difference. First operand 29651 states and 75225 transitions. Second operand 6 states. [2019-12-18 22:02:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:13,495 INFO L93 Difference]: Finished difference Result 29767 states and 75425 transitions. [2019-12-18 22:02:13,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:02:13,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 22:02:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:13,560 INFO L225 Difference]: With dead ends: 29767 [2019-12-18 22:02:13,561 INFO L226 Difference]: Without dead ends: 29767 [2019-12-18 22:02:13,563 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 22:02:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29767 states. [2019-12-18 22:02:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29767 to 29331. [2019-12-18 22:02:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29331 states. [2019-12-18 22:02:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29331 states to 29331 states and 74457 transitions. [2019-12-18 22:02:14,148 INFO L78 Accepts]: Start accepts. Automaton has 29331 states and 74457 transitions. Word has length 96 [2019-12-18 22:02:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:14,149 INFO L462 AbstractCegarLoop]: Abstraction has 29331 states and 74457 transitions. [2019-12-18 22:02:14,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:02:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 29331 states and 74457 transitions. [2019-12-18 22:02:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:14,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:14,189 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 22:02:14,190 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:14,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1626873274, now seen corresponding path program 15 times [2019-12-18 22:02:14,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:14,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127469058] [2019-12-18 22:02:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:14,357 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 22:02:14,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127469058] [2019-12-18 22:02:14,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:14,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:14,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727726596] [2019-12-18 22:02:14,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:14,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:14,358 INFO L87 Difference]: Start difference. First operand 29331 states and 74457 transitions. Second operand 10 states. [2019-12-18 22:02:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:15,326 INFO L93 Difference]: Finished difference Result 38855 states and 96262 transitions. [2019-12-18 22:02:15,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:02:15,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:02:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:15,376 INFO L225 Difference]: With dead ends: 38855 [2019-12-18 22:02:15,376 INFO L226 Difference]: Without dead ends: 38246 [2019-12-18 22:02:15,377 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 22:02:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2019-12-18 22:02:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 26988. [2019-12-18 22:02:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26988 states. [2019-12-18 22:02:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26988 states to 26988 states and 67849 transitions. [2019-12-18 22:02:15,818 INFO L78 Accepts]: Start accepts. Automaton has 26988 states and 67849 transitions. Word has length 96 [2019-12-18 22:02:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:15,818 INFO L462 AbstractCegarLoop]: Abstraction has 26988 states and 67849 transitions. [2019-12-18 22:02:15,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26988 states and 67849 transitions. [2019-12-18 22:02:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:16,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:16,110 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 22:02:16,110 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1068186320, now seen corresponding path program 16 times [2019-12-18 22:02:16,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:16,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324711681] [2019-12-18 22:02:16,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:16,267 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 22:02:16,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324711681] [2019-12-18 22:02:16,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:16,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:16,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561479439] [2019-12-18 22:02:16,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:16,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:16,269 INFO L87 Difference]: Start difference. First operand 26988 states and 67849 transitions. Second operand 10 states. [2019-12-18 22:02:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:16,892 INFO L93 Difference]: Finished difference Result 39688 states and 99273 transitions. [2019-12-18 22:02:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:02:16,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:02:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:16,938 INFO L225 Difference]: With dead ends: 39688 [2019-12-18 22:02:16,938 INFO L226 Difference]: Without dead ends: 38873 [2019-12-18 22:02:16,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:02:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38873 states. [2019-12-18 22:02:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38873 to 28133. [2019-12-18 22:02:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28133 states. [2019-12-18 22:02:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28133 states to 28133 states and 71089 transitions. [2019-12-18 22:02:17,371 INFO L78 Accepts]: Start accepts. Automaton has 28133 states and 71089 transitions. Word has length 96 [2019-12-18 22:02:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:17,371 INFO L462 AbstractCegarLoop]: Abstraction has 28133 states and 71089 transitions. [2019-12-18 22:02:17,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 28133 states and 71089 transitions. [2019-12-18 22:02:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:17,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:17,399 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 22:02:17,400 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash -282743896, now seen corresponding path program 17 times [2019-12-18 22:02:17,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:17,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901490968] [2019-12-18 22:02:17,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:17,595 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 22:02:17,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901490968] [2019-12-18 22:02:17,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:17,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:02:17,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390054633] [2019-12-18 22:02:17,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:17,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:17,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:17,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:17,597 INFO L87 Difference]: Start difference. First operand 28133 states and 71089 transitions. Second operand 11 states. [2019-12-18 22:02:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:18,778 INFO L93 Difference]: Finished difference Result 40875 states and 102560 transitions. [2019-12-18 22:02:18,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:02:18,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 22:02:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:18,833 INFO L225 Difference]: With dead ends: 40875 [2019-12-18 22:02:18,833 INFO L226 Difference]: Without dead ends: 40495 [2019-12-18 22:02:18,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 22:02:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40495 states. [2019-12-18 22:02:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40495 to 29683. [2019-12-18 22:02:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29683 states. [2019-12-18 22:02:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29683 states to 29683 states and 75119 transitions. [2019-12-18 22:02:19,530 INFO L78 Accepts]: Start accepts. Automaton has 29683 states and 75119 transitions. Word has length 96 [2019-12-18 22:02:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:19,531 INFO L462 AbstractCegarLoop]: Abstraction has 29683 states and 75119 transitions. [2019-12-18 22:02:19,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 29683 states and 75119 transitions. [2019-12-18 22:02:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:19,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:19,561 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 22:02:19,562 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961028, now seen corresponding path program 18 times [2019-12-18 22:02:19,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:19,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719546157] [2019-12-18 22:02:19,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:19,621 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 22:02:19,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719546157] [2019-12-18 22:02:19,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:19,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:02:19,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113975730] [2019-12-18 22:02:19,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:02:19,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:19,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:02:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:02:19,625 INFO L87 Difference]: Start difference. First operand 29683 states and 75119 transitions. Second operand 4 states. [2019-12-18 22:02:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:19,924 INFO L93 Difference]: Finished difference Result 43814 states and 108569 transitions. [2019-12-18 22:02:19,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:02:19,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-18 22:02:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:19,974 INFO L225 Difference]: With dead ends: 43814 [2019-12-18 22:02:19,975 INFO L226 Difference]: Without dead ends: 43766 [2019-12-18 22:02:19,975 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 22:02:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43766 states. [2019-12-18 22:02:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43766 to 34175. [2019-12-18 22:02:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34175 states. [2019-12-18 22:02:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34175 states to 34175 states and 86056 transitions. [2019-12-18 22:02:20,472 INFO L78 Accepts]: Start accepts. Automaton has 34175 states and 86056 transitions. Word has length 96 [2019-12-18 22:02:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:20,473 INFO L462 AbstractCegarLoop]: Abstraction has 34175 states and 86056 transitions. [2019-12-18 22:02:20,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:02:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 34175 states and 86056 transitions. [2019-12-18 22:02:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:20,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:20,508 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 22:02:20,508 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash -972283948, now seen corresponding path program 19 times [2019-12-18 22:02:20,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:20,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011400102] [2019-12-18 22:02:20,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:20,672 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 22:02:20,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011400102] [2019-12-18 22:02:20,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:20,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:02:20,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131748901] [2019-12-18 22:02:20,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:20,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:20,674 INFO L87 Difference]: Start difference. First operand 34175 states and 86056 transitions. Second operand 7 states. [2019-12-18 22:02:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:21,162 INFO L93 Difference]: Finished difference Result 34635 states and 86746 transitions. [2019-12-18 22:02:21,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:02:21,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 22:02:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:21,204 INFO L225 Difference]: With dead ends: 34635 [2019-12-18 22:02:21,204 INFO L226 Difference]: Without dead ends: 34635 [2019-12-18 22:02:21,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:02:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34635 states. [2019-12-18 22:02:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34635 to 30995. [2019-12-18 22:02:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30995 states. [2019-12-18 22:02:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30995 states to 30995 states and 77541 transitions. [2019-12-18 22:02:21,865 INFO L78 Accepts]: Start accepts. Automaton has 30995 states and 77541 transitions. Word has length 96 [2019-12-18 22:02:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:21,865 INFO L462 AbstractCegarLoop]: Abstraction has 30995 states and 77541 transitions. [2019-12-18 22:02:21,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 30995 states and 77541 transitions. [2019-12-18 22:02:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:21,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:21,897 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 22:02:21,897 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash -687852360, now seen corresponding path program 20 times [2019-12-18 22:02:21,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:21,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526166730] [2019-12-18 22:02:21,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:22,029 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 22:02:22,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526166730] [2019-12-18 22:02:22,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:22,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:02:22,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85104361] [2019-12-18 22:02:22,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:22,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:22,031 INFO L87 Difference]: Start difference. First operand 30995 states and 77541 transitions. Second operand 7 states. [2019-12-18 22:02:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:22,885 INFO L93 Difference]: Finished difference Result 33421 states and 83318 transitions. [2019-12-18 22:02:22,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:02:22,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 22:02:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:22,926 INFO L225 Difference]: With dead ends: 33421 [2019-12-18 22:02:22,926 INFO L226 Difference]: Without dead ends: 33421 [2019-12-18 22:02:22,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:22,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33421 states. [2019-12-18 22:02:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33421 to 29208. [2019-12-18 22:02:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29208 states. [2019-12-18 22:02:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29208 states to 29208 states and 72880 transitions. [2019-12-18 22:02:23,305 INFO L78 Accepts]: Start accepts. Automaton has 29208 states and 72880 transitions. Word has length 96 [2019-12-18 22:02:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:23,305 INFO L462 AbstractCegarLoop]: Abstraction has 29208 states and 72880 transitions. [2019-12-18 22:02:23,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 29208 states and 72880 transitions. [2019-12-18 22:02:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:23,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:23,332 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 22:02:23,332 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash 539305568, now seen corresponding path program 21 times [2019-12-18 22:02:23,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:23,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861351795] [2019-12-18 22:02:23,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:23,391 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 22:02:23,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861351795] [2019-12-18 22:02:23,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:23,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:02:23,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957658546] [2019-12-18 22:02:23,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:02:23,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:02:23,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:02:23,393 INFO L87 Difference]: Start difference. First operand 29208 states and 72880 transitions. Second operand 4 states. [2019-12-18 22:02:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:23,820 INFO L93 Difference]: Finished difference Result 40829 states and 101859 transitions. [2019-12-18 22:02:23,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:02:23,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-18 22:02:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:23,867 INFO L225 Difference]: With dead ends: 40829 [2019-12-18 22:02:23,868 INFO L226 Difference]: Without dead ends: 40784 [2019-12-18 22:02:23,868 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 22:02:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40784 states. [2019-12-18 22:02:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40784 to 30746. [2019-12-18 22:02:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30746 states. [2019-12-18 22:02:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30746 states to 30746 states and 76914 transitions. [2019-12-18 22:02:24,662 INFO L78 Accepts]: Start accepts. Automaton has 30746 states and 76914 transitions. Word has length 96 [2019-12-18 22:02:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:24,662 INFO L462 AbstractCegarLoop]: Abstraction has 30746 states and 76914 transitions. [2019-12-18 22:02:24,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:02:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 30746 states and 76914 transitions. [2019-12-18 22:02:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:24,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:24,690 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 22:02:24,690 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:24,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:24,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2034138278, now seen corresponding path program 22 times [2019-12-18 22:02:24,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:24,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274625392] [2019-12-18 22:02:24,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:24,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 22:02:24,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274625392] [2019-12-18 22:02:24,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:24,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:02:24,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099189273] [2019-12-18 22:02:24,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:02:24,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:02:24,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:02:24,762 INFO L87 Difference]: Start difference. First operand 30746 states and 76914 transitions. Second operand 4 states. [2019-12-18 22:02:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:25,178 INFO L93 Difference]: Finished difference Result 38485 states and 96444 transitions. [2019-12-18 22:02:25,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:02:25,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-18 22:02:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:25,224 INFO L225 Difference]: With dead ends: 38485 [2019-12-18 22:02:25,224 INFO L226 Difference]: Without dead ends: 38485 [2019-12-18 22:02:25,224 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 22:02:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38485 states. [2019-12-18 22:02:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38485 to 30443. [2019-12-18 22:02:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30443 states. [2019-12-18 22:02:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30443 states to 30443 states and 76209 transitions. [2019-12-18 22:02:25,642 INFO L78 Accepts]: Start accepts. Automaton has 30443 states and 76209 transitions. Word has length 96 [2019-12-18 22:02:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:25,642 INFO L462 AbstractCegarLoop]: Abstraction has 30443 states and 76209 transitions. [2019-12-18 22:02:25,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:02:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 30443 states and 76209 transitions. [2019-12-18 22:02:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:02:25,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:25,671 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 22:02:25,671 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash -157549914, now seen corresponding path program 23 times [2019-12-18 22:02:25,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:25,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872407328] [2019-12-18 22:02:25,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:25,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872407328] [2019-12-18 22:02:25,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:25,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:02:25,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37389315] [2019-12-18 22:02:25,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:02:25,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:25,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:02:25,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:02:25,969 INFO L87 Difference]: Start difference. First operand 30443 states and 76209 transitions. Second operand 12 states. [2019-12-18 22:02:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:28,350 INFO L93 Difference]: Finished difference Result 54076 states and 135536 transitions. [2019-12-18 22:02:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:02:28,351 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 22:02:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:28,421 INFO L225 Difference]: With dead ends: 54076 [2019-12-18 22:02:28,421 INFO L226 Difference]: Without dead ends: 53992 [2019-12-18 22:02:28,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53992 states. [2019-12-18 22:02:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53992 to 31716. [2019-12-18 22:02:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31716 states. [2019-12-18 22:02:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31716 states to 31716 states and 79634 transitions. [2019-12-18 22:02:29,250 INFO L78 Accepts]: Start accepts. Automaton has 31716 states and 79634 transitions. Word has length 96 [2019-12-18 22:02:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:29,250 INFO L462 AbstractCegarLoop]: Abstraction has 31716 states and 79634 transitions. [2019-12-18 22:02:29,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:02:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 31716 states and 79634 transitions. [2019-12-18 22:02:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:29,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:29,283 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 22:02:29,283 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash -515314851, now seen corresponding path program 1 times [2019-12-18 22:02:29,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:29,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959915950] [2019-12-18 22:02:29,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:29,560 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 22:02:29,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959915950] [2019-12-18 22:02:29,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:29,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:02:29,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620161870] [2019-12-18 22:02:29,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:02:29,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:29,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:02:29,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:02:29,561 INFO L87 Difference]: Start difference. First operand 31716 states and 79634 transitions. Second operand 14 states. [2019-12-18 22:02:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:34,991 INFO L93 Difference]: Finished difference Result 64904 states and 162278 transitions. [2019-12-18 22:02:34,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 22:02:34,991 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-18 22:02:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:35,068 INFO L225 Difference]: With dead ends: 64904 [2019-12-18 22:02:35,068 INFO L226 Difference]: Without dead ends: 57317 [2019-12-18 22:02:35,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=423, Invalid=2769, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 22:02:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57317 states. [2019-12-18 22:02:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57317 to 41899. [2019-12-18 22:02:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41899 states. [2019-12-18 22:02:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41899 states to 41899 states and 107202 transitions. [2019-12-18 22:02:35,987 INFO L78 Accepts]: Start accepts. Automaton has 41899 states and 107202 transitions. Word has length 97 [2019-12-18 22:02:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:35,987 INFO L462 AbstractCegarLoop]: Abstraction has 41899 states and 107202 transitions. [2019-12-18 22:02:35,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:02:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 41899 states and 107202 transitions. [2019-12-18 22:02:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:36,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:36,027 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 22:02:36,027 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash -760351099, now seen corresponding path program 2 times [2019-12-18 22:02:36,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:36,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171127293] [2019-12-18 22:02:36,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:36,122 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 22:02:36,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171127293] [2019-12-18 22:02:36,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:36,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:02:36,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6254207] [2019-12-18 22:02:36,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:02:36,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:36,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:02:36,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:36,123 INFO L87 Difference]: Start difference. First operand 41899 states and 107202 transitions. Second operand 6 states. [2019-12-18 22:02:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:36,341 INFO L93 Difference]: Finished difference Result 41510 states and 106036 transitions. [2019-12-18 22:02:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:02:36,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 22:02:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:36,391 INFO L225 Difference]: With dead ends: 41510 [2019-12-18 22:02:36,391 INFO L226 Difference]: Without dead ends: 41510 [2019-12-18 22:02:36,391 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 22:02:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41510 states. [2019-12-18 22:02:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41510 to 37538. [2019-12-18 22:02:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37538 states. [2019-12-18 22:02:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37538 states to 37538 states and 95958 transitions. [2019-12-18 22:02:36,883 INFO L78 Accepts]: Start accepts. Automaton has 37538 states and 95958 transitions. Word has length 97 [2019-12-18 22:02:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:36,883 INFO L462 AbstractCegarLoop]: Abstraction has 37538 states and 95958 transitions. [2019-12-18 22:02:36,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:02:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 37538 states and 95958 transitions. [2019-12-18 22:02:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:36,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:36,918 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 22:02:36,918 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash 627268243, now seen corresponding path program 1 times [2019-12-18 22:02:36,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:36,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216559379] [2019-12-18 22:02:36,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:37,035 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 22:02:37,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216559379] [2019-12-18 22:02:37,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:37,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:02:37,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440472492] [2019-12-18 22:02:37,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:37,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:37,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:37,037 INFO L87 Difference]: Start difference. First operand 37538 states and 95958 transitions. Second operand 7 states. [2019-12-18 22:02:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:38,448 INFO L93 Difference]: Finished difference Result 55824 states and 141650 transitions. [2019-12-18 22:02:38,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:02:38,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 22:02:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:38,519 INFO L225 Difference]: With dead ends: 55824 [2019-12-18 22:02:38,519 INFO L226 Difference]: Without dead ends: 55772 [2019-12-18 22:02:38,519 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 22:02:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55772 states. [2019-12-18 22:02:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55772 to 44056. [2019-12-18 22:02:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44056 states. [2019-12-18 22:02:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44056 states to 44056 states and 112629 transitions. [2019-12-18 22:02:39,177 INFO L78 Accepts]: Start accepts. Automaton has 44056 states and 112629 transitions. Word has length 97 [2019-12-18 22:02:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:39,177 INFO L462 AbstractCegarLoop]: Abstraction has 44056 states and 112629 transitions. [2019-12-18 22:02:39,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 44056 states and 112629 transitions. [2019-12-18 22:02:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:39,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:39,218 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 22:02:39,218 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 67369089, now seen corresponding path program 2 times [2019-12-18 22:02:39,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:39,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129751745] [2019-12-18 22:02:39,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:39,348 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 22:02:39,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129751745] [2019-12-18 22:02:39,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:39,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:02:39,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114872821] [2019-12-18 22:02:39,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:02:39,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:02:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:02:39,350 INFO L87 Difference]: Start difference. First operand 44056 states and 112629 transitions. Second operand 8 states. [2019-12-18 22:02:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:40,279 INFO L93 Difference]: Finished difference Result 54524 states and 137560 transitions. [2019-12-18 22:02:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:02:40,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 22:02:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:40,352 INFO L225 Difference]: With dead ends: 54524 [2019-12-18 22:02:40,352 INFO L226 Difference]: Without dead ends: 54517 [2019-12-18 22:02:40,352 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 22:02:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54517 states. [2019-12-18 22:02:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54517 to 43897. [2019-12-18 22:02:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43897 states. [2019-12-18 22:02:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43897 states to 43897 states and 112237 transitions. [2019-12-18 22:02:41,291 INFO L78 Accepts]: Start accepts. Automaton has 43897 states and 112237 transitions. Word has length 97 [2019-12-18 22:02:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:41,291 INFO L462 AbstractCegarLoop]: Abstraction has 43897 states and 112237 transitions. [2019-12-18 22:02:41,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:02:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 43897 states and 112237 transitions. [2019-12-18 22:02:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:41,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:41,337 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 22:02:41,337 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash 680862979, now seen corresponding path program 3 times [2019-12-18 22:02:41,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:41,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76901788] [2019-12-18 22:02:41,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:41,444 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 22:02:41,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76901788] [2019-12-18 22:02:41,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:41,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:02:41,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295330429] [2019-12-18 22:02:41,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:41,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:41,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:41,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:41,447 INFO L87 Difference]: Start difference. First operand 43897 states and 112237 transitions. Second operand 7 states. [2019-12-18 22:02:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:42,456 INFO L93 Difference]: Finished difference Result 61877 states and 156956 transitions. [2019-12-18 22:02:42,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:02:42,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 22:02:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:42,539 INFO L225 Difference]: With dead ends: 61877 [2019-12-18 22:02:42,539 INFO L226 Difference]: Without dead ends: 61863 [2019-12-18 22:02:42,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:02:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61863 states. [2019-12-18 22:02:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61863 to 46648. [2019-12-18 22:02:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46648 states. [2019-12-18 22:02:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46648 states to 46648 states and 119360 transitions. [2019-12-18 22:02:43,241 INFO L78 Accepts]: Start accepts. Automaton has 46648 states and 119360 transitions. Word has length 97 [2019-12-18 22:02:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:43,241 INFO L462 AbstractCegarLoop]: Abstraction has 46648 states and 119360 transitions. [2019-12-18 22:02:43,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 46648 states and 119360 transitions. [2019-12-18 22:02:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:43,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:43,289 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 22:02:43,289 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1167481557, now seen corresponding path program 4 times [2019-12-18 22:02:43,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:43,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259794418] [2019-12-18 22:02:43,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:43,945 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 22:02:43,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259794418] [2019-12-18 22:02:43,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:43,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-18 22:02:43,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787218214] [2019-12-18 22:02:43,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 22:02:43,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 22:02:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:02:43,946 INFO L87 Difference]: Start difference. First operand 46648 states and 119360 transitions. Second operand 25 states. [2019-12-18 22:02:44,707 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-12-18 22:02:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:50,029 INFO L93 Difference]: Finished difference Result 68570 states and 173982 transitions. [2019-12-18 22:02:50,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 22:02:50,033 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2019-12-18 22:02:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:50,114 INFO L225 Difference]: With dead ends: 68570 [2019-12-18 22:02:50,114 INFO L226 Difference]: Without dead ends: 61222 [2019-12-18 22:02:50,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 22:02:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61222 states. [2019-12-18 22:02:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61222 to 50229. [2019-12-18 22:02:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50229 states. [2019-12-18 22:02:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50229 states to 50229 states and 128441 transitions. [2019-12-18 22:02:51,231 INFO L78 Accepts]: Start accepts. Automaton has 50229 states and 128441 transitions. Word has length 97 [2019-12-18 22:02:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:51,231 INFO L462 AbstractCegarLoop]: Abstraction has 50229 states and 128441 transitions. [2019-12-18 22:02:51,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 22:02:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 50229 states and 128441 transitions. [2019-12-18 22:02:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:51,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:51,278 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 22:02:51,278 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:51,279 INFO L82 PathProgramCache]: Analyzing trace with hash -151439719, now seen corresponding path program 5 times [2019-12-18 22:02:51,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:51,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95165464] [2019-12-18 22:02:51,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:51,421 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 22:02:51,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95165464] [2019-12-18 22:02:51,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:51,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:02:51,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732523066] [2019-12-18 22:02:51,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:02:51,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:02:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:02:51,423 INFO L87 Difference]: Start difference. First operand 50229 states and 128441 transitions. Second operand 12 states. [2019-12-18 22:02:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:52,397 INFO L93 Difference]: Finished difference Result 63968 states and 162351 transitions. [2019-12-18 22:02:52,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 22:02:52,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-18 22:02:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:52,480 INFO L225 Difference]: With dead ends: 63968 [2019-12-18 22:02:52,480 INFO L226 Difference]: Without dead ends: 61569 [2019-12-18 22:02:52,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:02:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61569 states. [2019-12-18 22:02:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61569 to 49605. [2019-12-18 22:02:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49605 states. [2019-12-18 22:02:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49605 states to 49605 states and 127061 transitions. [2019-12-18 22:02:53,236 INFO L78 Accepts]: Start accepts. Automaton has 49605 states and 127061 transitions. Word has length 97 [2019-12-18 22:02:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:53,236 INFO L462 AbstractCegarLoop]: Abstraction has 49605 states and 127061 transitions. [2019-12-18 22:02:53,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:02:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 49605 states and 127061 transitions. [2019-12-18 22:02:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:53,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:53,289 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 22:02:53,289 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:53,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1324771947, now seen corresponding path program 6 times [2019-12-18 22:02:53,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:53,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235429577] [2019-12-18 22:02:53,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:53,378 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 22:02:53,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235429577] [2019-12-18 22:02:53,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:53,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:02:53,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373829803] [2019-12-18 22:02:53,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:53,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:53,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:53,380 INFO L87 Difference]: Start difference. First operand 49605 states and 127061 transitions. Second operand 7 states. [2019-12-18 22:02:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:54,136 INFO L93 Difference]: Finished difference Result 51294 states and 130955 transitions. [2019-12-18 22:02:54,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:02:54,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 22:02:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:54,202 INFO L225 Difference]: With dead ends: 51294 [2019-12-18 22:02:54,202 INFO L226 Difference]: Without dead ends: 51294 [2019-12-18 22:02:54,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 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 22:02:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51294 states. [2019-12-18 22:02:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51294 to 49254. [2019-12-18 22:02:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49254 states. [2019-12-18 22:02:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49254 states to 49254 states and 126142 transitions. [2019-12-18 22:02:55,069 INFO L78 Accepts]: Start accepts. Automaton has 49254 states and 126142 transitions. Word has length 97 [2019-12-18 22:02:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:55,069 INFO L462 AbstractCegarLoop]: Abstraction has 49254 states and 126142 transitions. [2019-12-18 22:02:55,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 49254 states and 126142 transitions. [2019-12-18 22:02:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:55,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:55,120 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 22:02:55,120 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1254988047, now seen corresponding path program 7 times [2019-12-18 22:02:55,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:55,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995487423] [2019-12-18 22:02:55,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:55,468 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 22:02:55,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995487423] [2019-12-18 22:02:55,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:55,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:02:55,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356466125] [2019-12-18 22:02:55,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:02:55,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:55,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:02:55,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:02:55,470 INFO L87 Difference]: Start difference. First operand 49254 states and 126142 transitions. Second operand 14 states. [2019-12-18 22:02:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:57,887 INFO L93 Difference]: Finished difference Result 81685 states and 207933 transitions. [2019-12-18 22:02:57,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:02:57,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-18 22:02:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:58,002 INFO L225 Difference]: With dead ends: 81685 [2019-12-18 22:02:58,002 INFO L226 Difference]: Without dead ends: 81685 [2019-12-18 22:02:58,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2019-12-18 22:02:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81685 states. [2019-12-18 22:02:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81685 to 49854. [2019-12-18 22:02:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49854 states. [2019-12-18 22:02:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49854 states to 49854 states and 128252 transitions. [2019-12-18 22:02:59,211 INFO L78 Accepts]: Start accepts. Automaton has 49854 states and 128252 transitions. Word has length 97 [2019-12-18 22:02:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:59,211 INFO L462 AbstractCegarLoop]: Abstraction has 49854 states and 128252 transitions. [2019-12-18 22:02:59,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:02:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 49854 states and 128252 transitions. [2019-12-18 22:02:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:59,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:59,266 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 22:02:59,267 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:59,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash 699912021, now seen corresponding path program 8 times [2019-12-18 22:02:59,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:59,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244222519] [2019-12-18 22:02:59,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:00,166 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 22:03:00,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244222519] [2019-12-18 22:03:00,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:00,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-18 22:03:00,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990867152] [2019-12-18 22:03:00,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-18 22:03:00,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:00,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-18 22:03:00,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:03:00,168 INFO L87 Difference]: Start difference. First operand 49854 states and 128252 transitions. Second operand 26 states. Received shutdown request... [2019-12-18 22:03:06,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 22:03:06,930 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 22:03:06,934 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 22:03:06,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:03:06 BasicIcfg [2019-12-18 22:03:06,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:03:06,936 INFO L168 Benchmark]: Toolchain (without parser) took 205250.18 ms. Allocated memory was 145.8 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 102.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 22:03:06,936 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:03:06,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.39 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 154.5 MB in the end (delta: -52.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:06,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.37 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:06,937 INFO L168 Benchmark]: Boogie Preprocessor took 46.20 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 147.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:06,938 INFO L168 Benchmark]: RCFGBuilder took 1212.87 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 147.8 MB in the beginning and 191.2 MB in the end (delta: -43.4 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:06,938 INFO L168 Benchmark]: TraceAbstraction took 203090.48 ms. Allocated memory was 235.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 191.2 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 22:03:06,940 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.67 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.39 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 154.5 MB in the end (delta: -52.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 99.37 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.20 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 147.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1212.87 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 147.8 MB in the beginning and 191.2 MB in the end (delta: -43.4 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203090.48 ms. Allocated memory was 235.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 191.2 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 244 ProgramPointsBefore, 156 ProgramPointsAfterwards, 326 TransitionsBefore, 194 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 47 ChoiceCompositions, 17563 VarBasedMoverChecksPositive, 349 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 331194 CheckedPairsTotal, 139 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 (49854states) and FLOYD_HOARE automaton (currently 45 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (60655 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 (49854states) and FLOYD_HOARE automaton (currently 45 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (60655 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 202.8s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 78.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20854 SDtfs, 25148 SDslu, 96141 SDs, 0 SdLazy, 44396 SolverSat, 1253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 172 SyntacticMatches, 67 SemanticMatches, 697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4179 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243454occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 92.9s AutomataMinimizationTime, 48 MinimizatonAttempts, 354758 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 4115 NumberOfCodeBlocks, 4115 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 4066 ConstructedInterpolants, 0 QuantifiedInterpolants, 1351612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 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