/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.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:59:42,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:59:42,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:59:42,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:59:42,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:59:42,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:59:42,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:59:42,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:59:42,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:59:42,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:59:42,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:59:42,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:59:42,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:59:42,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:59:42,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:59:42,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:59:42,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:59:42,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:59:42,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:59:42,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:59:42,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:59:42,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:59:42,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:59:42,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:59:42,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:59:42,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:59:42,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:59:42,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:59:42,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:59:42,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:59:42,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:59:42,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:59:42,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:59:42,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:59:42,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:59:42,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:59:42,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:59:42,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:59:42,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:59:42,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:59:42,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:59:42,573 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:42,593 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:59:42,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:59:42,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:59:42,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:59:42,598 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:59:42,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:59:42,598 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:59:42,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:59:42,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:59:42,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:59:42,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:59:42,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:59:42,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:59:42,601 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:59:42,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:59:42,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:59:42,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:59:42,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:59:42,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:59:42,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:59:42,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:59:42,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:59:42,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:59:42,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:59:42,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:59:42,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:59:42,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:59:42,604 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:59:42,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:59:42,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:59:42,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:59:42,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:59:42,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:59:42,926 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:59:42,926 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:59:42,927 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2019-12-18 21:59:42,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56eedefb/6eb822b1dba04a4ea0b0e5598df71d3c/FLAG04b7192f6 [2019-12-18 21:59:43,603 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:59:43,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2019-12-18 21:59:43,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56eedefb/6eb822b1dba04a4ea0b0e5598df71d3c/FLAG04b7192f6 [2019-12-18 21:59:43,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56eedefb/6eb822b1dba04a4ea0b0e5598df71d3c [2019-12-18 21:59:43,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:59:43,853 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:59:43,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:43,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:59:43,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:59:43,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:43" (1/1) ... [2019-12-18 21:59:43,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc0254b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:43, skipping insertion in model container [2019-12-18 21:59:43,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:43" (1/1) ... [2019-12-18 21:59:43,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:59:43,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:59:44,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:44,554 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:59:44,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:44,787 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:59:44,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:44 WrapperNode [2019-12-18 21:59:44,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:44,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:44,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:59:44,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:59:44,800 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:44" (1/1) ... [2019-12-18 21:59:44,852 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:44" (1/1) ... [2019-12-18 21:59:44,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:44,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:59:44,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:59:44,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:59:44,920 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:44" (1/1) ... [2019-12-18 21:59:44,921 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:44" (1/1) ... [2019-12-18 21:59:44,925 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:44" (1/1) ... [2019-12-18 21:59:44,926 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:44" (1/1) ... [2019-12-18 21:59:44,953 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:44" (1/1) ... [2019-12-18 21:59:44,965 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:44" (1/1) ... [2019-12-18 21:59:44,972 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:44" (1/1) ... [2019-12-18 21:59:44,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:59:44,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:59:44,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:59:44,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:59:44,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:44" (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:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:59:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:59:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:59:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:59:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:59:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:59:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:59:45,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:59:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:59:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:59:45,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:59:45,060 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:46,015 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:59:46,016 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:59:46,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:46 BoogieIcfgContainer [2019-12-18 21:59:46,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:59:46,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:59:46,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:59:46,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:59:46,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:59:43" (1/3) ... [2019-12-18 21:59:46,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1d8228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:46, skipping insertion in model container [2019-12-18 21:59:46,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:44" (2/3) ... [2019-12-18 21:59:46,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1d8228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:46, skipping insertion in model container [2019-12-18 21:59:46,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:46" (3/3) ... [2019-12-18 21:59:46,025 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2019-12-18 21:59:46,037 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:59:46,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:59:46,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:59:46,051 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:59:46,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,163 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:46,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,221 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,222 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:46,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,223 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:46,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:59:46,254 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:59:46,254 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:59:46,254 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:59:46,255 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:59:46,255 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:59:46,255 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:59:46,255 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:59:46,255 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:59:46,273 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 21:59:46,275 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 21:59:46,448 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 21:59:46,448 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:46,486 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:46,556 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 21:59:46,671 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 21:59:46,672 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:46,692 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:46,738 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 21:59:46,739 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:59:50,835 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:59:50,949 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:59:51,055 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-18 21:59:51,056 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-18 21:59:51,062 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-18 22:00:06,301 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-18 22:00:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-18 22:00:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:00:06,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:06,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:00:06,311 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:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-18 22:00:06,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:06,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992714558] [2019-12-18 22:00:06,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:06,580 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:06,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992714558] [2019-12-18 22:00:06,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:06,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:00:06,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552163538] [2019-12-18 22:00:06,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:00:06,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:00:06,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:00:06,599 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-18 22:00:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:08,138 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-18 22:00:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:00:08,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:00:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:08,958 INFO L225 Difference]: With dead ends: 120599 [2019-12-18 22:00:08,958 INFO L226 Difference]: Without dead ends: 118034 [2019-12-18 22:00:08,960 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:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-18 22:00:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-18 22:00:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-18 22:00:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-18 22:00:20,090 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-18 22:00:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:20,090 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-18 22:00:20,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:00:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-18 22:00:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:00:20,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:20,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:20,094 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:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-18 22:00:20,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:20,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056436946] [2019-12-18 22:00:20,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:20,213 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:20,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056436946] [2019-12-18 22:00:20,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:20,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:00:20,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512299867] [2019-12-18 22:00:20,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:00:20,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:20,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:00:20,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:00:20,216 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 4 states. [2019-12-18 22:00:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:25,094 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-18 22:00:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:00:25,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:00:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:25,538 INFO L225 Difference]: With dead ends: 156706 [2019-12-18 22:00:25,538 INFO L226 Difference]: Without dead ends: 156706 [2019-12-18 22:00:25,539 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:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-18 22:00:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-18 22:00:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-18 22:00:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-18 22:00:37,887 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-18 22:00:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:37,888 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-18 22:00:37,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:00:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-18 22:00:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:00:37,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:37,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:37,890 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:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-18 22:00:37,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:37,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415907831] [2019-12-18 22:00:37,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:37,988 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:37,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415907831] [2019-12-18 22:00:37,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:37,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:00:37,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636034087] [2019-12-18 22:00:37,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:00:37,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:37,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:00:37,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:00:37,990 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-18 22:00:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:43,316 INFO L93 Difference]: Finished difference Result 203727 states and 733867 transitions. [2019-12-18 22:00:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:00:43,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:00:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:43,825 INFO L225 Difference]: With dead ends: 203727 [2019-12-18 22:00:43,825 INFO L226 Difference]: Without dead ends: 203727 [2019-12-18 22:00:43,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203727 states. [2019-12-18 22:00:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203727 to 189697. [2019-12-18 22:00:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189697 states. [2019-12-18 22:00:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189697 states to 189697 states and 685577 transitions. [2019-12-18 22:00:56,249 INFO L78 Accepts]: Start accepts. Automaton has 189697 states and 685577 transitions. Word has length 11 [2019-12-18 22:00:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:56,249 INFO L462 AbstractCegarLoop]: Abstraction has 189697 states and 685577 transitions. [2019-12-18 22:00:56,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:00:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 189697 states and 685577 transitions. [2019-12-18 22:00:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:00:56,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:56,258 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:00:56,258 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:00:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:56,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1176638523, now seen corresponding path program 1 times [2019-12-18 22:00:56,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:56,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124381287] [2019-12-18 22:00:56,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:56,360 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:56,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124381287] [2019-12-18 22:00:56,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:56,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:00:56,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411854014] [2019-12-18 22:00:56,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:00:56,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:00:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:00:56,362 INFO L87 Difference]: Start difference. First operand 189697 states and 685577 transitions. Second operand 4 states. [2019-12-18 22:00:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:56,446 INFO L93 Difference]: Finished difference Result 12243 states and 33691 transitions. [2019-12-18 22:00:56,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:00:56,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 22:00:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:56,461 INFO L225 Difference]: With dead ends: 12243 [2019-12-18 22:00:56,461 INFO L226 Difference]: Without dead ends: 8871 [2019-12-18 22:00:56,461 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:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2019-12-18 22:00:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8863. [2019-12-18 22:00:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8863 states. [2019-12-18 22:00:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8863 states to 8863 states and 22087 transitions. [2019-12-18 22:00:56,612 INFO L78 Accepts]: Start accepts. Automaton has 8863 states and 22087 transitions. Word has length 17 [2019-12-18 22:00:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:56,612 INFO L462 AbstractCegarLoop]: Abstraction has 8863 states and 22087 transitions. [2019-12-18 22:00:56,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:00:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 8863 states and 22087 transitions. [2019-12-18 22:00:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:00:56,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:56,616 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:00:56,616 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:00:56,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:56,617 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-18 22:00:56,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:56,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973296896] [2019-12-18 22:00:56,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:56,919 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:56,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973296896] [2019-12-18 22:00:56,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:56,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:00:56,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674873107] [2019-12-18 22:00:56,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:00:56,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:56,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:00:56,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:00:56,922 INFO L87 Difference]: Start difference. First operand 8863 states and 22087 transitions. Second operand 7 states. [2019-12-18 22:00:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:58,199 INFO L93 Difference]: Finished difference Result 10373 states and 25522 transitions. [2019-12-18 22:00:58,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:00:58,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 22:00:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:58,213 INFO L225 Difference]: With dead ends: 10373 [2019-12-18 22:00:58,213 INFO L226 Difference]: Without dead ends: 10373 [2019-12-18 22:00:58,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:00:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10373 states. [2019-12-18 22:00:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10373 to 10258. [2019-12-18 22:00:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10258 states. [2019-12-18 22:00:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10258 states to 10258 states and 25292 transitions. [2019-12-18 22:00:58,385 INFO L78 Accepts]: Start accepts. Automaton has 10258 states and 25292 transitions. Word has length 25 [2019-12-18 22:00:58,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:58,389 INFO L462 AbstractCegarLoop]: Abstraction has 10258 states and 25292 transitions. [2019-12-18 22:00:58,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:00:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 10258 states and 25292 transitions. [2019-12-18 22:00:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 22:00:58,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:58,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:58,397 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:00:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-18 22:00:58,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:58,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959995308] [2019-12-18 22:00:58,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:58,694 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:58,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959995308] [2019-12-18 22:00:58,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:58,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:00:58,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240483850] [2019-12-18 22:00:58,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:00:58,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:58,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:00:58,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:00:58,697 INFO L87 Difference]: Start difference. First operand 10258 states and 25292 transitions. Second operand 8 states. [2019-12-18 22:01:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:00,108 INFO L93 Difference]: Finished difference Result 11253 states and 27362 transitions. [2019-12-18 22:01:00,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:01:00,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-18 22:01:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:00,122 INFO L225 Difference]: With dead ends: 11253 [2019-12-18 22:01:00,122 INFO L226 Difference]: Without dead ends: 11205 [2019-12-18 22:01:00,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:01:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11205 states. [2019-12-18 22:01:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11205 to 10966. [2019-12-18 22:01:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10966 states. [2019-12-18 22:01:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10966 states to 10966 states and 26799 transitions. [2019-12-18 22:01:00,252 INFO L78 Accepts]: Start accepts. Automaton has 10966 states and 26799 transitions. Word has length 38 [2019-12-18 22:01:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:00,252 INFO L462 AbstractCegarLoop]: Abstraction has 10966 states and 26799 transitions. [2019-12-18 22:01:00,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:01:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 10966 states and 26799 transitions. [2019-12-18 22:01:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 22:01:00,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:00,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] [2019-12-18 22:01:00,266 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:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-18 22:01:00,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:00,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625997468] [2019-12-18 22:01:00,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:01,852 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:01,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625997468] [2019-12-18 22:01:01,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:01,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:01:01,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126877773] [2019-12-18 22:01:01,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:01:01,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:01:01,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:01:01,854 INFO L87 Difference]: Start difference. First operand 10966 states and 26799 transitions. Second operand 9 states. [2019-12-18 22:01:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:03,638 INFO L93 Difference]: Finished difference Result 12991 states and 31377 transitions. [2019-12-18 22:01:03,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:01:03,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-18 22:01:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:03,654 INFO L225 Difference]: With dead ends: 12991 [2019-12-18 22:01:03,654 INFO L226 Difference]: Without dead ends: 12991 [2019-12-18 22:01:03,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:01:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12991 states. [2019-12-18 22:01:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12991 to 11783. [2019-12-18 22:01:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11783 states. [2019-12-18 22:01:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 28661 transitions. [2019-12-18 22:01:03,790 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 28661 transitions. Word has length 50 [2019-12-18 22:01:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:03,791 INFO L462 AbstractCegarLoop]: Abstraction has 11783 states and 28661 transitions. [2019-12-18 22:01:03,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:01:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 28661 transitions. [2019-12-18 22:01:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 22:01:03,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:03,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:01:03,804 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:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash -597968020, now seen corresponding path program 1 times [2019-12-18 22:01:03,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:03,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642788062] [2019-12-18 22:01:03,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:03,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:01:03,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642788062] [2019-12-18 22:01:03,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:03,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:01:03,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603425792] [2019-12-18 22:01:03,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:03,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:03,912 INFO L87 Difference]: Start difference. First operand 11783 states and 28661 transitions. Second operand 5 states. [2019-12-18 22:01:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:04,778 INFO L93 Difference]: Finished difference Result 13164 states and 31589 transitions. [2019-12-18 22:01:04,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:01:04,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 22:01:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:04,794 INFO L225 Difference]: With dead ends: 13164 [2019-12-18 22:01:04,794 INFO L226 Difference]: Without dead ends: 13164 [2019-12-18 22:01:04,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-18 22:01:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12761. [2019-12-18 22:01:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12761 states. [2019-12-18 22:01:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 30780 transitions. [2019-12-18 22:01:04,941 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 30780 transitions. Word has length 57 [2019-12-18 22:01:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:04,942 INFO L462 AbstractCegarLoop]: Abstraction has 12761 states and 30780 transitions. [2019-12-18 22:01:04,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 30780 transitions. [2019-12-18 22:01:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 22:01:04,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:04,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:01:04,954 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:04,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:04,954 INFO L82 PathProgramCache]: Analyzing trace with hash 428916562, now seen corresponding path program 1 times [2019-12-18 22:01:04,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:04,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936935644] [2019-12-18 22:01:04,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:05,066 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:05,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936935644] [2019-12-18 22:01:05,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:05,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:01:05,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716634833] [2019-12-18 22:01:05,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:05,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:05,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:05,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:05,068 INFO L87 Difference]: Start difference. First operand 12761 states and 30780 transitions. Second operand 5 states. [2019-12-18 22:01:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:05,218 INFO L93 Difference]: Finished difference Result 13183 states and 31674 transitions. [2019-12-18 22:01:05,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:01:05,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 22:01:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:05,233 INFO L225 Difference]: With dead ends: 13183 [2019-12-18 22:01:05,233 INFO L226 Difference]: Without dead ends: 12979 [2019-12-18 22:01:05,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12979 states. [2019-12-18 22:01:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12979 to 12679. [2019-12-18 22:01:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12679 states. [2019-12-18 22:01:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12679 states to 12679 states and 30608 transitions. [2019-12-18 22:01:05,376 INFO L78 Accepts]: Start accepts. Automaton has 12679 states and 30608 transitions. Word has length 58 [2019-12-18 22:01:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:05,376 INFO L462 AbstractCegarLoop]: Abstraction has 12679 states and 30608 transitions. [2019-12-18 22:01:05,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 12679 states and 30608 transitions. [2019-12-18 22:01:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:01:05,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:05,387 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] [2019-12-18 22:01:05,388 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:05,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash 829880521, now seen corresponding path program 1 times [2019-12-18 22:01:05,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:05,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520511691] [2019-12-18 22:01:05,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:05,678 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:05,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520511691] [2019-12-18 22:01:05,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:05,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:01:05,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839853699] [2019-12-18 22:01:05,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:01:05,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:01:05,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:01:05,680 INFO L87 Difference]: Start difference. First operand 12679 states and 30608 transitions. Second operand 10 states. [2019-12-18 22:01:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:08,601 INFO L93 Difference]: Finished difference Result 14014 states and 33582 transitions. [2019-12-18 22:01:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:01:08,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-18 22:01:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:08,616 INFO L225 Difference]: With dead ends: 14014 [2019-12-18 22:01:08,616 INFO L226 Difference]: Without dead ends: 14013 [2019-12-18 22:01:08,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:01:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14013 states. [2019-12-18 22:01:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14013 to 13324. [2019-12-18 22:01:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13324 states. [2019-12-18 22:01:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13324 states to 13324 states and 32067 transitions. [2019-12-18 22:01:08,784 INFO L78 Accepts]: Start accepts. Automaton has 13324 states and 32067 transitions. Word has length 64 [2019-12-18 22:01:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:08,785 INFO L462 AbstractCegarLoop]: Abstraction has 13324 states and 32067 transitions. [2019-12-18 22:01:08,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:01:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 13324 states and 32067 transitions. [2019-12-18 22:01:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 22:01:08,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:08,800 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] [2019-12-18 22:01:08,801 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:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1352436757, now seen corresponding path program 1 times [2019-12-18 22:01:08,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:08,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79454290] [2019-12-18 22:01:08,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:08,907 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:08,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79454290] [2019-12-18 22:01:08,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:08,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:01:08,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999211183] [2019-12-18 22:01:08,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:01:08,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:08,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:01:08,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:01:08,912 INFO L87 Difference]: Start difference. First operand 13324 states and 32067 transitions. Second operand 3 states. [2019-12-18 22:01:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:09,006 INFO L93 Difference]: Finished difference Result 13324 states and 31981 transitions. [2019-12-18 22:01:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:01:09,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-18 22:01:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:09,026 INFO L225 Difference]: With dead ends: 13324 [2019-12-18 22:01:09,026 INFO L226 Difference]: Without dead ends: 13324 [2019-12-18 22:01:09,027 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:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-12-18 22:01:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 13316. [2019-12-18 22:01:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-12-18 22:01:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 31965 transitions. [2019-12-18 22:01:09,206 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 31965 transitions. Word has length 69 [2019-12-18 22:01:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:09,207 INFO L462 AbstractCegarLoop]: Abstraction has 13316 states and 31965 transitions. [2019-12-18 22:01:09,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:01:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 31965 transitions. [2019-12-18 22:01:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 22:01:09,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,221 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:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash 635717682, now seen corresponding path program 1 times [2019-12-18 22:01:09,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:09,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126178503] [2019-12-18 22:01:09,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:09,317 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:09,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126178503] [2019-12-18 22:01:09,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:09,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:01:09,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002035401] [2019-12-18 22:01:09,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:09,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:09,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:09,319 INFO L87 Difference]: Start difference. First operand 13316 states and 31965 transitions. Second operand 5 states. [2019-12-18 22:01:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:10,249 INFO L93 Difference]: Finished difference Result 14499 states and 34487 transitions. [2019-12-18 22:01:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:01:10,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-18 22:01:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:10,271 INFO L225 Difference]: With dead ends: 14499 [2019-12-18 22:01:10,271 INFO L226 Difference]: Without dead ends: 14499 [2019-12-18 22:01:10,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14499 states. [2019-12-18 22:01:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14499 to 14115. [2019-12-18 22:01:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14115 states. [2019-12-18 22:01:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14115 states to 14115 states and 33724 transitions. [2019-12-18 22:01:10,490 INFO L78 Accepts]: Start accepts. Automaton has 14115 states and 33724 transitions. Word has length 70 [2019-12-18 22:01:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:10,490 INFO L462 AbstractCegarLoop]: Abstraction has 14115 states and 33724 transitions. [2019-12-18 22:01:10,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 14115 states and 33724 transitions. [2019-12-18 22:01:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 22:01:10,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:10,504 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] [2019-12-18 22:01:10,505 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:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash 18467660, now seen corresponding path program 1 times [2019-12-18 22:01:10,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:10,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703216065] [2019-12-18 22:01:10,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:10,632 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:10,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703216065] [2019-12-18 22:01:10,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:10,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:01:10,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754795627] [2019-12-18 22:01:10,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:10,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:10,634 INFO L87 Difference]: Start difference. First operand 14115 states and 33724 transitions. Second operand 5 states. [2019-12-18 22:01:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:10,839 INFO L93 Difference]: Finished difference Result 14944 states and 35509 transitions. [2019-12-18 22:01:10,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:01:10,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-18 22:01:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:10,860 INFO L225 Difference]: With dead ends: 14944 [2019-12-18 22:01:10,861 INFO L226 Difference]: Without dead ends: 14830 [2019-12-18 22:01:10,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:01:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14830 states. [2019-12-18 22:01:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14830 to 14106. [2019-12-18 22:01:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14106 states. [2019-12-18 22:01:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14106 states to 14106 states and 33706 transitions. [2019-12-18 22:01:11,051 INFO L78 Accepts]: Start accepts. Automaton has 14106 states and 33706 transitions. Word has length 71 [2019-12-18 22:01:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:11,051 INFO L462 AbstractCegarLoop]: Abstraction has 14106 states and 33706 transitions. [2019-12-18 22:01:11,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 14106 states and 33706 transitions. [2019-12-18 22:01:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 22:01:11,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:11,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:01:11,064 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:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1274147225, now seen corresponding path program 1 times [2019-12-18 22:01:11,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:11,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699925507] [2019-12-18 22:01:11,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:01:11,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699925507] [2019-12-18 22:01:11,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:11,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:01:11,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915357862] [2019-12-18 22:01:11,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:11,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:11,177 INFO L87 Difference]: Start difference. First operand 14106 states and 33706 transitions. Second operand 5 states. [2019-12-18 22:01:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:11,368 INFO L93 Difference]: Finished difference Result 13307 states and 31857 transitions. [2019-12-18 22:01:11,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:01:11,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-18 22:01:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:11,395 INFO L225 Difference]: With dead ends: 13307 [2019-12-18 22:01:11,395 INFO L226 Difference]: Without dead ends: 13307 [2019-12-18 22:01:11,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:01:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13307 states. [2019-12-18 22:01:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13307 to 13234. [2019-12-18 22:01:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13234 states. [2019-12-18 22:01:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13234 states to 13234 states and 31711 transitions. [2019-12-18 22:01:11,657 INFO L78 Accepts]: Start accepts. Automaton has 13234 states and 31711 transitions. Word has length 72 [2019-12-18 22:01:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:11,658 INFO L462 AbstractCegarLoop]: Abstraction has 13234 states and 31711 transitions. [2019-12-18 22:01:11,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 13234 states and 31711 transitions. [2019-12-18 22:01:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 22:01:11,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:11,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,674 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:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:11,674 INFO L82 PathProgramCache]: Analyzing trace with hash 509778932, now seen corresponding path program 1 times [2019-12-18 22:01:11,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:11,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597444866] [2019-12-18 22:01:11,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:11,771 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:11,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597444866] [2019-12-18 22:01:11,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:11,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:01:11,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608446582] [2019-12-18 22:01:11,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:01:11,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:01:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:01:11,773 INFO L87 Difference]: Start difference. First operand 13234 states and 31711 transitions. Second operand 3 states. [2019-12-18 22:01:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:11,867 INFO L93 Difference]: Finished difference Result 13234 states and 31605 transitions. [2019-12-18 22:01:11,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:01:11,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-18 22:01:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:11,889 INFO L225 Difference]: With dead ends: 13234 [2019-12-18 22:01:11,889 INFO L226 Difference]: Without dead ends: 13234 [2019-12-18 22:01:11,889 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:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13234 states. [2019-12-18 22:01:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13234 to 13033. [2019-12-18 22:01:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13033 states. [2019-12-18 22:01:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13033 states to 13033 states and 31205 transitions. [2019-12-18 22:01:12,175 INFO L78 Accepts]: Start accepts. Automaton has 13033 states and 31205 transitions. Word has length 72 [2019-12-18 22:01:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:12,176 INFO L462 AbstractCegarLoop]: Abstraction has 13033 states and 31205 transitions. [2019-12-18 22:01:12,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:01:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13033 states and 31205 transitions. [2019-12-18 22:01:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 22:01:12,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:12,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] [2019-12-18 22:01:12,189 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:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash 409333706, now seen corresponding path program 1 times [2019-12-18 22:01:12,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:12,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161410676] [2019-12-18 22:01:12,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:12,352 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:12,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161410676] [2019-12-18 22:01:12,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:12,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:01:12,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577306117] [2019-12-18 22:01:12,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:12,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:12,354 INFO L87 Difference]: Start difference. First operand 13033 states and 31205 transitions. Second operand 5 states. [2019-12-18 22:01:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:12,441 INFO L93 Difference]: Finished difference Result 5318 states and 12360 transitions. [2019-12-18 22:01:12,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:01:12,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-18 22:01:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:12,449 INFO L225 Difference]: With dead ends: 5318 [2019-12-18 22:01:12,449 INFO L226 Difference]: Without dead ends: 5093 [2019-12-18 22:01:12,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:01:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2019-12-18 22:01:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 4956. [2019-12-18 22:01:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4956 states. [2019-12-18 22:01:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 11610 transitions. [2019-12-18 22:01:12,507 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 11610 transitions. Word has length 73 [2019-12-18 22:01:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:12,507 INFO L462 AbstractCegarLoop]: Abstraction has 4956 states and 11610 transitions. [2019-12-18 22:01:12,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 11610 transitions. [2019-12-18 22:01:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:12,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:12,513 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:01:12,513 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:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -642360557, now seen corresponding path program 1 times [2019-12-18 22:01:12,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:12,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227810011] [2019-12-18 22:01:12,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:12,702 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:12,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227810011] [2019-12-18 22:01:12,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:12,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:01:12,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156758793] [2019-12-18 22:01:12,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:01:12,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:01:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:01:12,704 INFO L87 Difference]: Start difference. First operand 4956 states and 11610 transitions. Second operand 10 states. [2019-12-18 22:01:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:13,685 INFO L93 Difference]: Finished difference Result 11973 states and 27232 transitions. [2019-12-18 22:01:13,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:01:13,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:01:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:13,698 INFO L225 Difference]: With dead ends: 11973 [2019-12-18 22:01:13,698 INFO L226 Difference]: Without dead ends: 10403 [2019-12-18 22:01:13,698 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:01:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10403 states. [2019-12-18 22:01:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10403 to 6677. [2019-12-18 22:01:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6677 states. [2019-12-18 22:01:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 16012 transitions. [2019-12-18 22:01:13,791 INFO L78 Accepts]: Start accepts. Automaton has 6677 states and 16012 transitions. Word has length 97 [2019-12-18 22:01:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:13,791 INFO L462 AbstractCegarLoop]: Abstraction has 6677 states and 16012 transitions. [2019-12-18 22:01:13,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:01:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6677 states and 16012 transitions. [2019-12-18 22:01:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:13,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:13,800 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:01:13,800 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:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash 509064979, now seen corresponding path program 2 times [2019-12-18 22:01:13,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:13,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006886213] [2019-12-18 22:01:13,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:14,265 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:14,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006886213] [2019-12-18 22:01:14,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:14,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 22:01:14,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986540653] [2019-12-18 22:01:14,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 22:01:14,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:14,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 22:01:14,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:01:14,267 INFO L87 Difference]: Start difference. First operand 6677 states and 16012 transitions. Second operand 20 states. [2019-12-18 22:01:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:20,209 INFO L93 Difference]: Finished difference Result 11579 states and 27627 transitions. [2019-12-18 22:01:20,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 22:01:20,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-18 22:01:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:20,222 INFO L225 Difference]: With dead ends: 11579 [2019-12-18 22:01:20,222 INFO L226 Difference]: Without dead ends: 10949 [2019-12-18 22:01:20,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 22:01:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10949 states. [2019-12-18 22:01:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10949 to 8259. [2019-12-18 22:01:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8259 states. [2019-12-18 22:01:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 19979 transitions. [2019-12-18 22:01:20,322 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 19979 transitions. Word has length 97 [2019-12-18 22:01:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:20,322 INFO L462 AbstractCegarLoop]: Abstraction has 8259 states and 19979 transitions. [2019-12-18 22:01:20,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 22:01:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 19979 transitions. [2019-12-18 22:01:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:20,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:20,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, 1] [2019-12-18 22:01:20,332 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:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1176229779, now seen corresponding path program 3 times [2019-12-18 22:01:20,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:20,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637767841] [2019-12-18 22:01:20,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:20,435 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:20,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637767841] [2019-12-18 22:01:20,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:20,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:01:20,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775799487] [2019-12-18 22:01:20,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:01:20,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:01:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:20,437 INFO L87 Difference]: Start difference. First operand 8259 states and 19979 transitions. Second operand 6 states. [2019-12-18 22:01:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:20,586 INFO L93 Difference]: Finished difference Result 9342 states and 22234 transitions. [2019-12-18 22:01:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:01:20,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 22:01:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:20,597 INFO L225 Difference]: With dead ends: 9342 [2019-12-18 22:01:20,598 INFO L226 Difference]: Without dead ends: 8492 [2019-12-18 22:01:20,598 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:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8492 states. [2019-12-18 22:01:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8492 to 8454. [2019-12-18 22:01:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8454 states. [2019-12-18 22:01:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8454 states to 8454 states and 20430 transitions. [2019-12-18 22:01:20,696 INFO L78 Accepts]: Start accepts. Automaton has 8454 states and 20430 transitions. Word has length 97 [2019-12-18 22:01:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:20,696 INFO L462 AbstractCegarLoop]: Abstraction has 8454 states and 20430 transitions. [2019-12-18 22:01:20,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:01:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8454 states and 20430 transitions. [2019-12-18 22:01:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:20,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:20,704 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:01:20,704 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:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -166061845, now seen corresponding path program 4 times [2019-12-18 22:01:20,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:20,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839807780] [2019-12-18 22:01:20,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:20,996 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:20,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839807780] [2019-12-18 22:01:20,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:20,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 22:01:20,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591596980] [2019-12-18 22:01:20,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:01:20,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:20,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:01:20,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:01:20,998 INFO L87 Difference]: Start difference. First operand 8454 states and 20430 transitions. Second operand 16 states. [2019-12-18 22:01:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:24,205 INFO L93 Difference]: Finished difference Result 19564 states and 47832 transitions. [2019-12-18 22:01:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 22:01:24,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2019-12-18 22:01:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:24,227 INFO L225 Difference]: With dead ends: 19564 [2019-12-18 22:01:24,228 INFO L226 Difference]: Without dead ends: 18828 [2019-12-18 22:01:24,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:01:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18828 states. [2019-12-18 22:01:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18828 to 12548. [2019-12-18 22:01:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12548 states. [2019-12-18 22:01:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12548 states to 12548 states and 31352 transitions. [2019-12-18 22:01:24,415 INFO L78 Accepts]: Start accepts. Automaton has 12548 states and 31352 transitions. Word has length 97 [2019-12-18 22:01:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:24,416 INFO L462 AbstractCegarLoop]: Abstraction has 12548 states and 31352 transitions. [2019-12-18 22:01:24,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:01:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 12548 states and 31352 transitions. [2019-12-18 22:01:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:24,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:24,427 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:01:24,427 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:24,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:24,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1327631825, now seen corresponding path program 5 times [2019-12-18 22:01:24,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:24,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783436627] [2019-12-18 22:01:24,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:24,527 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,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783436627] [2019-12-18 22:01:24,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:24,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:01:24,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048291974] [2019-12-18 22:01:24,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:24,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:24,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:24,529 INFO L87 Difference]: Start difference. First operand 12548 states and 31352 transitions. Second operand 5 states. [2019-12-18 22:01:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:25,039 INFO L93 Difference]: Finished difference Result 17044 states and 42791 transitions. [2019-12-18 22:01:25,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:01:25,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-18 22:01:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:25,059 INFO L225 Difference]: With dead ends: 17044 [2019-12-18 22:01:25,059 INFO L226 Difference]: Without dead ends: 17044 [2019-12-18 22:01:25,060 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:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17044 states. [2019-12-18 22:01:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17044 to 15255. [2019-12-18 22:01:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15255 states. [2019-12-18 22:01:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15255 states to 15255 states and 38274 transitions. [2019-12-18 22:01:25,314 INFO L78 Accepts]: Start accepts. Automaton has 15255 states and 38274 transitions. Word has length 97 [2019-12-18 22:01:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:25,315 INFO L462 AbstractCegarLoop]: Abstraction has 15255 states and 38274 transitions. [2019-12-18 22:01:25,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 15255 states and 38274 transitions. [2019-12-18 22:01:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:25,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:25,330 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:01:25,330 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:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash 627268243, now seen corresponding path program 6 times [2019-12-18 22:01:25,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:25,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870070714] [2019-12-18 22:01:25,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:25,451 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:25,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870070714] [2019-12-18 22:01:25,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:25,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:01:25,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850074176] [2019-12-18 22:01:25,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:01:25,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:25,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:01:25,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:01:25,453 INFO L87 Difference]: Start difference. First operand 15255 states and 38274 transitions. Second operand 7 states. [2019-12-18 22:01:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:26,305 INFO L93 Difference]: Finished difference Result 21469 states and 53640 transitions. [2019-12-18 22:01:26,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:01:26,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 22:01:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:26,338 INFO L225 Difference]: With dead ends: 21469 [2019-12-18 22:01:26,338 INFO L226 Difference]: Without dead ends: 21469 [2019-12-18 22:01:26,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 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:01:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21469 states. [2019-12-18 22:01:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21469 to 16057. [2019-12-18 22:01:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16057 states. [2019-12-18 22:01:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16057 states to 16057 states and 40243 transitions. [2019-12-18 22:01:26,586 INFO L78 Accepts]: Start accepts. Automaton has 16057 states and 40243 transitions. Word has length 97 [2019-12-18 22:01:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:26,586 INFO L462 AbstractCegarLoop]: Abstraction has 16057 states and 40243 transitions. [2019-12-18 22:01:26,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:01:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 16057 states and 40243 transitions. [2019-12-18 22:01:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:26,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:26,602 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:01:26,602 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:01:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:26,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1887530979, now seen corresponding path program 7 times [2019-12-18 22:01:26,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:26,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334467919] [2019-12-18 22:01:26,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:27,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:27,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334467919] [2019-12-18 22:01:27,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:27,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-18 22:01:27,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637521451] [2019-12-18 22:01:27,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 22:01:27,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:27,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 22:01:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:01:27,465 INFO L87 Difference]: Start difference. First operand 16057 states and 40243 transitions. Second operand 25 states. [2019-12-18 22:01:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:41,806 INFO L93 Difference]: Finished difference Result 30043 states and 74296 transitions. [2019-12-18 22:01:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-18 22:01:41,807 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2019-12-18 22:01:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:41,841 INFO L225 Difference]: With dead ends: 30043 [2019-12-18 22:01:41,841 INFO L226 Difference]: Without dead ends: 28995 [2019-12-18 22:01:41,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4036 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1171, Invalid=11261, Unknown=0, NotChecked=0, Total=12432 [2019-12-18 22:01:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28995 states. [2019-12-18 22:01:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28995 to 20302. [2019-12-18 22:01:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20302 states. [2019-12-18 22:01:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20302 states to 20302 states and 50951 transitions. [2019-12-18 22:01:42,213 INFO L78 Accepts]: Start accepts. Automaton has 20302 states and 50951 transitions. Word has length 97 [2019-12-18 22:01:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:42,214 INFO L462 AbstractCegarLoop]: Abstraction has 20302 states and 50951 transitions. [2019-12-18 22:01:42,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 22:01:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 20302 states and 50951 transitions. [2019-12-18 22:01:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:42,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:42,235 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:01:42,235 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:01:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1930591181, now seen corresponding path program 8 times [2019-12-18 22:01:42,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:42,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438576416] [2019-12-18 22:01:42,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:42,373 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:42,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438576416] [2019-12-18 22:01:42,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:42,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:01:42,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321897669] [2019-12-18 22:01:42,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:01:42,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:01:42,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:01:42,377 INFO L87 Difference]: Start difference. First operand 20302 states and 50951 transitions. Second operand 8 states. [2019-12-18 22:01:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:43,435 INFO L93 Difference]: Finished difference Result 25807 states and 64125 transitions. [2019-12-18 22:01:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:01:43,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 22:01:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:43,466 INFO L225 Difference]: With dead ends: 25807 [2019-12-18 22:01:43,466 INFO L226 Difference]: Without dead ends: 25807 [2019-12-18 22:01:43,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 5 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:01:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25807 states. [2019-12-18 22:01:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25807 to 20320. [2019-12-18 22:01:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20320 states. [2019-12-18 22:01:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20320 states to 20320 states and 50995 transitions. [2019-12-18 22:01:43,754 INFO L78 Accepts]: Start accepts. Automaton has 20320 states and 50995 transitions. Word has length 97 [2019-12-18 22:01:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:43,754 INFO L462 AbstractCegarLoop]: Abstraction has 20320 states and 50995 transitions. [2019-12-18 22:01:43,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:01:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 20320 states and 50995 transitions. [2019-12-18 22:01:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:43,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:43,777 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:01:43,777 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:01:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:43,777 INFO L82 PathProgramCache]: Analyzing trace with hash 680862979, now seen corresponding path program 9 times [2019-12-18 22:01:43,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:43,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187636030] [2019-12-18 22:01:43,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:43,880 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:43,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187636030] [2019-12-18 22:01:43,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:43,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:01:43,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782590287] [2019-12-18 22:01:43,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:01:43,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:01:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:01:43,882 INFO L87 Difference]: Start difference. First operand 20320 states and 50995 transitions. Second operand 7 states. [2019-12-18 22:01:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:45,042 INFO L93 Difference]: Finished difference Result 25650 states and 63927 transitions. [2019-12-18 22:01:45,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:01:45,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 22:01:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:45,074 INFO L225 Difference]: With dead ends: 25650 [2019-12-18 22:01:45,074 INFO L226 Difference]: Without dead ends: 25650 [2019-12-18 22:01:45,075 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:01:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25650 states. [2019-12-18 22:01:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25650 to 21586. [2019-12-18 22:01:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21586 states. [2019-12-18 22:01:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21586 states to 21586 states and 54185 transitions. [2019-12-18 22:01:45,384 INFO L78 Accepts]: Start accepts. Automaton has 21586 states and 54185 transitions. Word has length 97 [2019-12-18 22:01:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:45,385 INFO L462 AbstractCegarLoop]: Abstraction has 21586 states and 54185 transitions. [2019-12-18 22:01:45,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:01:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 21586 states and 54185 transitions. [2019-12-18 22:01:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:45,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:45,411 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:01:45,411 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:01:45,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:45,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1167481557, now seen corresponding path program 10 times [2019-12-18 22:01:45,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:45,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236969714] [2019-12-18 22:01:45,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:45,713 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,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236969714] [2019-12-18 22:01:45,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:45,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:01:45,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013515004] [2019-12-18 22:01:45,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:01:45,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:45,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:01:45,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:01:45,715 INFO L87 Difference]: Start difference. First operand 21586 states and 54185 transitions. Second operand 11 states. [2019-12-18 22:01:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:47,067 INFO L93 Difference]: Finished difference Result 23549 states and 58774 transitions. [2019-12-18 22:01:47,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:01:47,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 22:01:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:47,092 INFO L225 Difference]: With dead ends: 23549 [2019-12-18 22:01:47,092 INFO L226 Difference]: Without dead ends: 23442 [2019-12-18 22:01:47,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:01:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23442 states. [2019-12-18 22:01:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23442 to 22361. [2019-12-18 22:01:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22361 states. [2019-12-18 22:01:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22361 states to 22361 states and 56038 transitions. [2019-12-18 22:01:47,365 INFO L78 Accepts]: Start accepts. Automaton has 22361 states and 56038 transitions. Word has length 97 [2019-12-18 22:01:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:47,366 INFO L462 AbstractCegarLoop]: Abstraction has 22361 states and 56038 transitions. [2019-12-18 22:01:47,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:01:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22361 states and 56038 transitions. [2019-12-18 22:01:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:47,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:47,390 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:01:47,390 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:01:47,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:47,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1546206219, now seen corresponding path program 11 times [2019-12-18 22:01:47,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:47,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233392493] [2019-12-18 22:01:47,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:47,682 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,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233392493] [2019-12-18 22:01:47,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:47,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:01:47,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374090319] [2019-12-18 22:01:47,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:01:47,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:01:47,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:01:47,684 INFO L87 Difference]: Start difference. First operand 22361 states and 56038 transitions. Second operand 10 states. [2019-12-18 22:01:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:49,035 INFO L93 Difference]: Finished difference Result 23683 states and 59011 transitions. [2019-12-18 22:01:49,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:01:49,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:01:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:49,065 INFO L225 Difference]: With dead ends: 23683 [2019-12-18 22:01:49,065 INFO L226 Difference]: Without dead ends: 23683 [2019-12-18 22:01:49,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-12-18 22:01:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23683 states. [2019-12-18 22:01:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23683 to 22297. [2019-12-18 22:01:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22297 states. [2019-12-18 22:01:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22297 states to 22297 states and 55898 transitions. [2019-12-18 22:01:49,368 INFO L78 Accepts]: Start accepts. Automaton has 22297 states and 55898 transitions. Word has length 97 [2019-12-18 22:01:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:49,368 INFO L462 AbstractCegarLoop]: Abstraction has 22297 states and 55898 transitions. [2019-12-18 22:01:49,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:01:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22297 states and 55898 transitions. [2019-12-18 22:01:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:49,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:49,394 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:01:49,394 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:01:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash 581708757, now seen corresponding path program 12 times [2019-12-18 22:01:49,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:49,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264728618] [2019-12-18 22:01:49,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:49,798 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,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264728618] [2019-12-18 22:01:49,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:49,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 22:01:49,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856703487] [2019-12-18 22:01:49,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 22:01:49,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:49,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 22:01:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:01:49,799 INFO L87 Difference]: Start difference. First operand 22297 states and 55898 transitions. Second operand 17 states. [2019-12-18 22:01:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:59,230 INFO L93 Difference]: Finished difference Result 36565 states and 91708 transitions. [2019-12-18 22:01:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-18 22:01:59,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2019-12-18 22:01:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:59,274 INFO L225 Difference]: With dead ends: 36565 [2019-12-18 22:01:59,275 INFO L226 Difference]: Without dead ends: 35113 [2019-12-18 22:01:59,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1212, Invalid=7160, Unknown=0, NotChecked=0, Total=8372 [2019-12-18 22:01:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35113 states. [2019-12-18 22:01:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35113 to 26794. [2019-12-18 22:01:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26794 states. [2019-12-18 22:01:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26794 states to 26794 states and 67704 transitions. [2019-12-18 22:01:59,672 INFO L78 Accepts]: Start accepts. Automaton has 26794 states and 67704 transitions. Word has length 97 [2019-12-18 22:01:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:59,672 INFO L462 AbstractCegarLoop]: Abstraction has 26794 states and 67704 transitions. [2019-12-18 22:01:59,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 22:01:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 26794 states and 67704 transitions. [2019-12-18 22:01:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:59,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:59,698 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:01:59,699 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:01:59,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1838849039, now seen corresponding path program 13 times [2019-12-18 22:01:59,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:59,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469412422] [2019-12-18 22:01:59,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:59,957 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,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469412422] [2019-12-18 22:01:59,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:59,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:01:59,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206906189] [2019-12-18 22:01:59,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:01:59,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:01:59,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:01:59,960 INFO L87 Difference]: Start difference. First operand 26794 states and 67704 transitions. Second operand 13 states. [2019-12-18 22:02:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:01,553 INFO L93 Difference]: Finished difference Result 34218 states and 85583 transitions. [2019-12-18 22:02:01,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 22:02:01,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-12-18 22:02:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:01,593 INFO L225 Difference]: With dead ends: 34218 [2019-12-18 22:02:01,594 INFO L226 Difference]: Without dead ends: 33106 [2019-12-18 22:02:01,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 22:02:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33106 states. [2019-12-18 22:02:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33106 to 27068. [2019-12-18 22:02:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27068 states. [2019-12-18 22:02:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27068 states to 27068 states and 68260 transitions. [2019-12-18 22:02:01,989 INFO L78 Accepts]: Start accepts. Automaton has 27068 states and 68260 transitions. Word has length 97 [2019-12-18 22:02:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:01,989 INFO L462 AbstractCegarLoop]: Abstraction has 27068 states and 68260 transitions. [2019-12-18 22:02:01,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:02:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27068 states and 68260 transitions. [2019-12-18 22:02:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:02,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:02,020 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:02,020 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:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1703353957, now seen corresponding path program 14 times [2019-12-18 22:02:02,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:02,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803597335] [2019-12-18 22:02:02,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:02,161 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:02,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803597335] [2019-12-18 22:02:02,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:02,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:02,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848188082] [2019-12-18 22:02:02,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:02,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:02,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:02,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:02,163 INFO L87 Difference]: Start difference. First operand 27068 states and 68260 transitions. Second operand 10 states. [2019-12-18 22:02:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:03,111 INFO L93 Difference]: Finished difference Result 44563 states and 110510 transitions. [2019-12-18 22:02:03,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:02:03,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:02:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:03,166 INFO L225 Difference]: With dead ends: 44563 [2019-12-18 22:02:03,167 INFO L226 Difference]: Without dead ends: 43789 [2019-12-18 22:02:03,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 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:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43789 states. [2019-12-18 22:02:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43789 to 28688. [2019-12-18 22:02:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28688 states. [2019-12-18 22:02:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28688 states to 28688 states and 72533 transitions. [2019-12-18 22:02:03,630 INFO L78 Accepts]: Start accepts. Automaton has 28688 states and 72533 transitions. Word has length 97 [2019-12-18 22:02:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:03,630 INFO L462 AbstractCegarLoop]: Abstraction has 28688 states and 72533 transitions. [2019-12-18 22:02:03,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28688 states and 72533 transitions. [2019-12-18 22:02:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:03,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:03,658 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:03,658 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:03,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1847298937, now seen corresponding path program 15 times [2019-12-18 22:02:03,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:03,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169768910] [2019-12-18 22:02:03,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:04,356 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,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169768910] [2019-12-18 22:02:04,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:04,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 22:02:04,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913784608] [2019-12-18 22:02:04,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 22:02:04,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 22:02:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:04,359 INFO L87 Difference]: Start difference. First operand 28688 states and 72533 transitions. Second operand 23 states. [2019-12-18 22:02:05,411 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-12-18 22:02:11,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:11,874 INFO L93 Difference]: Finished difference Result 47713 states and 120399 transitions. [2019-12-18 22:02:11,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-18 22:02:11,874 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2019-12-18 22:02:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:11,933 INFO L225 Difference]: With dead ends: 47713 [2019-12-18 22:02:11,934 INFO L226 Difference]: Without dead ends: 46867 [2019-12-18 22:02:11,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=881, Invalid=5761, Unknown=0, NotChecked=0, Total=6642 [2019-12-18 22:02:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46867 states. [2019-12-18 22:02:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46867 to 28618. [2019-12-18 22:02:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28618 states. [2019-12-18 22:02:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28618 states to 28618 states and 71939 transitions. [2019-12-18 22:02:12,440 INFO L78 Accepts]: Start accepts. Automaton has 28618 states and 71939 transitions. Word has length 97 [2019-12-18 22:02:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:12,440 INFO L462 AbstractCegarLoop]: Abstraction has 28618 states and 71939 transitions. [2019-12-18 22:02:12,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 22:02:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28618 states and 71939 transitions. [2019-12-18 22:02:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:12,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:12,483 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:12,483 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:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1254988047, now seen corresponding path program 16 times [2019-12-18 22:02:12,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:12,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454080081] [2019-12-18 22:02:12,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:12,722 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,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454080081] [2019-12-18 22:02:12,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:12,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:12,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098660724] [2019-12-18 22:02:12,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:12,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:12,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:12,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:12,725 INFO L87 Difference]: Start difference. First operand 28618 states and 71939 transitions. Second operand 10 states. [2019-12-18 22:02:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:14,597 INFO L93 Difference]: Finished difference Result 47315 states and 119314 transitions. [2019-12-18 22:02:14,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:02:14,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:02:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:14,662 INFO L225 Difference]: With dead ends: 47315 [2019-12-18 22:02:14,662 INFO L226 Difference]: Without dead ends: 47315 [2019-12-18 22:02:14,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:02:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47315 states. [2019-12-18 22:02:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47315 to 30459. [2019-12-18 22:02:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30459 states. [2019-12-18 22:02:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30459 states to 30459 states and 76359 transitions. [2019-12-18 22:02:15,152 INFO L78 Accepts]: Start accepts. Automaton has 30459 states and 76359 transitions. Word has length 97 [2019-12-18 22:02:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:15,152 INFO L462 AbstractCegarLoop]: Abstraction has 30459 states and 76359 transitions. [2019-12-18 22:02:15,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 30459 states and 76359 transitions. [2019-12-18 22:02:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:15,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:15,181 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:15,181 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:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:15,181 INFO L82 PathProgramCache]: Analyzing trace with hash 699912021, now seen corresponding path program 17 times [2019-12-18 22:02:15,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:15,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839564503] [2019-12-18 22:02:15,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:15,536 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:15,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839564503] [2019-12-18 22:02:15,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:15,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:02:15,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600513130] [2019-12-18 22:02:15,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:02:15,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:15,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:02:15,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:02:15,538 INFO L87 Difference]: Start difference. First operand 30459 states and 76359 transitions. Second operand 15 states. [2019-12-18 22:02:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:18,590 INFO L93 Difference]: Finished difference Result 47867 states and 119614 transitions. [2019-12-18 22:02:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 22:02:18,591 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-12-18 22:02:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:18,652 INFO L225 Difference]: With dead ends: 47867 [2019-12-18 22:02:18,652 INFO L226 Difference]: Without dead ends: 47825 [2019-12-18 22:02:18,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:02:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47825 states. [2019-12-18 22:02:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47825 to 31475. [2019-12-18 22:02:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31475 states. [2019-12-18 22:02:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31475 states to 31475 states and 78860 transitions. [2019-12-18 22:02:19,313 INFO L78 Accepts]: Start accepts. Automaton has 31475 states and 78860 transitions. Word has length 97 [2019-12-18 22:02:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:19,314 INFO L462 AbstractCegarLoop]: Abstraction has 31475 states and 78860 transitions. [2019-12-18 22:02:19,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:02:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 31475 states and 78860 transitions. [2019-12-18 22:02:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:19,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:19,345 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:19,345 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,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2003234959, now seen corresponding path program 18 times [2019-12-18 22:02:19,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:19,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524980648] [2019-12-18 22:02:19,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:20,001 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,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524980648] [2019-12-18 22:02:20,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:20,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 22:02:20,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713509325] [2019-12-18 22:02:20,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 22:02:20,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:20,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 22:02:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:20,003 INFO L87 Difference]: Start difference. First operand 31475 states and 78860 transitions. Second operand 23 states. [2019-12-18 22:02:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:27,106 INFO L93 Difference]: Finished difference Result 52395 states and 130732 transitions. [2019-12-18 22:02:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-18 22:02:27,106 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2019-12-18 22:02:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:27,174 INFO L225 Difference]: With dead ends: 52395 [2019-12-18 22:02:27,174 INFO L226 Difference]: Without dead ends: 52047 [2019-12-18 22:02:27,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=678, Invalid=4724, Unknown=0, NotChecked=0, Total=5402 [2019-12-18 22:02:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52047 states. [2019-12-18 22:02:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52047 to 32521. [2019-12-18 22:02:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32521 states. [2019-12-18 22:02:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32521 states to 32521 states and 81228 transitions. [2019-12-18 22:02:27,881 INFO L78 Accepts]: Start accepts. Automaton has 32521 states and 81228 transitions. Word has length 97 [2019-12-18 22:02:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:27,881 INFO L462 AbstractCegarLoop]: Abstraction has 32521 states and 81228 transitions. [2019-12-18 22:02:27,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 22:02:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32521 states and 81228 transitions. [2019-12-18 22:02:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:27,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:27,916 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:27,916 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:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash 870693137, now seen corresponding path program 19 times [2019-12-18 22:02:27,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:27,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887685718] [2019-12-18 22:02:27,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:28,423 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:28,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887685718] [2019-12-18 22:02:28,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:28,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 22:02:28,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839631554] [2019-12-18 22:02:28,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 22:02:28,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:28,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 22:02:28,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:02:28,425 INFO L87 Difference]: Start difference. First operand 32521 states and 81228 transitions. Second operand 19 states. [2019-12-18 22:02:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:34,068 INFO L93 Difference]: Finished difference Result 49027 states and 122616 transitions. [2019-12-18 22:02:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 22:02:34,069 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-12-18 22:02:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:34,128 INFO L225 Difference]: With dead ends: 49027 [2019-12-18 22:02:34,128 INFO L226 Difference]: Without dead ends: 48830 [2019-12-18 22:02:34,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=290, Invalid=1872, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 22:02:34,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48830 states. [2019-12-18 22:02:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48830 to 32674. [2019-12-18 22:02:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32674 states. [2019-12-18 22:02:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32674 states to 32674 states and 81621 transitions. [2019-12-18 22:02:34,778 INFO L78 Accepts]: Start accepts. Automaton has 32674 states and 81621 transitions. Word has length 97 [2019-12-18 22:02:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:34,779 INFO L462 AbstractCegarLoop]: Abstraction has 32674 states and 81621 transitions. [2019-12-18 22:02:34,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 22:02:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32674 states and 81621 transitions. [2019-12-18 22:02:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:34,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:34,811 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:34,811 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:34,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash -163249103, now seen corresponding path program 20 times [2019-12-18 22:02:34,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:34,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933770145] [2019-12-18 22:02:34,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:35,864 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:35,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933770145] [2019-12-18 22:02:35,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:35,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-18 22:02:35,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998508791] [2019-12-18 22:02:35,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-18 22:02:35,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:35,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-18 22:02:35,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:02:35,866 INFO L87 Difference]: Start difference. First operand 32674 states and 81621 transitions. Second operand 26 states. [2019-12-18 22:02:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:43,700 INFO L93 Difference]: Finished difference Result 46991 states and 117269 transitions. [2019-12-18 22:02:43,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 22:02:43,700 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2019-12-18 22:02:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:43,754 INFO L225 Difference]: With dead ends: 46991 [2019-12-18 22:02:43,755 INFO L226 Difference]: Without dead ends: 43362 [2019-12-18 22:02:43,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=457, Invalid=3325, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 22:02:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43362 states. [2019-12-18 22:02:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43362 to 36942. [2019-12-18 22:02:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36942 states. [2019-12-18 22:02:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36942 states to 36942 states and 92444 transitions. [2019-12-18 22:02:44,412 INFO L78 Accepts]: Start accepts. Automaton has 36942 states and 92444 transitions. Word has length 97 [2019-12-18 22:02:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:44,413 INFO L462 AbstractCegarLoop]: Abstraction has 36942 states and 92444 transitions. [2019-12-18 22:02:44,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-18 22:02:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 36942 states and 92444 transitions. [2019-12-18 22:02:44,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:44,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:44,460 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:44,460 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:44,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:44,461 INFO L82 PathProgramCache]: Analyzing trace with hash -169868167, now seen corresponding path program 21 times [2019-12-18 22:02:44,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:44,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807764032] [2019-12-18 22:02:44,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:44,662 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:44,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807764032] [2019-12-18 22:02:44,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:44,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:02:44,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859789586] [2019-12-18 22:02:44,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:44,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:44,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:44,664 INFO L87 Difference]: Start difference. First operand 36942 states and 92444 transitions. Second operand 11 states. [2019-12-18 22:02:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:46,129 INFO L93 Difference]: Finished difference Result 51899 states and 130172 transitions. [2019-12-18 22:02:46,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:02:46,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 22:02:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:46,197 INFO L225 Difference]: With dead ends: 51899 [2019-12-18 22:02:46,197 INFO L226 Difference]: Without dead ends: 51899 [2019-12-18 22:02:46,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51899 states. [2019-12-18 22:02:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51899 to 37277. [2019-12-18 22:02:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37277 states. [2019-12-18 22:02:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37277 states to 37277 states and 93354 transitions. [2019-12-18 22:02:46,808 INFO L78 Accepts]: Start accepts. Automaton has 37277 states and 93354 transitions. Word has length 97 [2019-12-18 22:02:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:46,808 INFO L462 AbstractCegarLoop]: Abstraction has 37277 states and 93354 transitions. [2019-12-18 22:02:46,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 37277 states and 93354 transitions. [2019-12-18 22:02:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:46,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:46,846 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:46,846 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:46,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:46,846 INFO L82 PathProgramCache]: Analyzing trace with hash -193593507, now seen corresponding path program 22 times [2019-12-18 22:02:46,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:46,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511224273] [2019-12-18 22:02:46,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:47,576 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:47,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511224273] [2019-12-18 22:02:47,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:47,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 22:02:47,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265771269] [2019-12-18 22:02:47,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 22:02:47,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:47,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 22:02:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:47,578 INFO L87 Difference]: Start difference. First operand 37277 states and 93354 transitions. Second operand 23 states. [2019-12-18 22:02:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:55,005 INFO L93 Difference]: Finished difference Result 57346 states and 143498 transitions. [2019-12-18 22:02:55,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 22:02:55,006 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2019-12-18 22:02:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:55,073 INFO L225 Difference]: With dead ends: 57346 [2019-12-18 22:02:55,073 INFO L226 Difference]: Without dead ends: 53372 [2019-12-18 22:02:55,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=289, Invalid=2261, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 22:02:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53372 states. [2019-12-18 22:02:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53372 to 45134. [2019-12-18 22:02:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45134 states. [2019-12-18 22:02:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45134 states to 45134 states and 114166 transitions. [2019-12-18 22:02:55,681 INFO L78 Accepts]: Start accepts. Automaton has 45134 states and 114166 transitions. Word has length 97 [2019-12-18 22:02:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:55,682 INFO L462 AbstractCegarLoop]: Abstraction has 45134 states and 114166 transitions. [2019-12-18 22:02:55,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 22:02:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 45134 states and 114166 transitions. [2019-12-18 22:02:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:55,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:55,727 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,727 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:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 723162353, now seen corresponding path program 23 times [2019-12-18 22:02:55,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:55,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220885471] [2019-12-18 22:02:55,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:55,909 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,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220885471] [2019-12-18 22:02:55,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:55,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:55,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170112806] [2019-12-18 22:02:55,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:55,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:55,910 INFO L87 Difference]: Start difference. First operand 45134 states and 114166 transitions. Second operand 10 states. [2019-12-18 22:02:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:57,596 INFO L93 Difference]: Finished difference Result 59840 states and 150846 transitions. [2019-12-18 22:02:57,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 22:02:57,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:02:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:57,675 INFO L225 Difference]: With dead ends: 59840 [2019-12-18 22:02:57,675 INFO L226 Difference]: Without dead ends: 59840 [2019-12-18 22:02:57,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:02:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59840 states. [2019-12-18 22:02:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59840 to 42970. [2019-12-18 22:02:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42970 states. [2019-12-18 22:02:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42970 states to 42970 states and 108922 transitions. [2019-12-18 22:02:58,330 INFO L78 Accepts]: Start accepts. Automaton has 42970 states and 108922 transitions. Word has length 97 [2019-12-18 22:02:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:58,330 INFO L462 AbstractCegarLoop]: Abstraction has 42970 states and 108922 transitions. [2019-12-18 22:02:58,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 42970 states and 108922 transitions. [2019-12-18 22:02:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:02:58,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:58,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:58,377 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:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash 362203226, now seen corresponding path program 1 times [2019-12-18 22:02:58,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:58,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534865771] [2019-12-18 22:02:58,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:58,684 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:58,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534865771] [2019-12-18 22:02:58,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:58,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:02:58,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947802381] [2019-12-18 22:02:58,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:02:58,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:02:58,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:02:58,686 INFO L87 Difference]: Start difference. First operand 42970 states and 108922 transitions. Second operand 12 states. [2019-12-18 22:03:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:03,436 INFO L93 Difference]: Finished difference Result 100733 states and 251490 transitions. [2019-12-18 22:03:03,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 22:03:03,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-12-18 22:03:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:03,538 INFO L225 Difference]: With dead ends: 100733 [2019-12-18 22:03:03,538 INFO L226 Difference]: Without dead ends: 88055 [2019-12-18 22:03:03,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1560, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 22:03:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88055 states. [2019-12-18 22:03:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88055 to 57739. [2019-12-18 22:03:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57739 states. [2019-12-18 22:03:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57739 states to 57739 states and 148369 transitions. [2019-12-18 22:03:04,475 INFO L78 Accepts]: Start accepts. Automaton has 57739 states and 148369 transitions. Word has length 98 [2019-12-18 22:03:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:04,476 INFO L462 AbstractCegarLoop]: Abstraction has 57739 states and 148369 transitions. [2019-12-18 22:03:04,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:03:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 57739 states and 148369 transitions. [2019-12-18 22:03:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:03:04,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:04,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:04,545 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:03:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:04,545 INFO L82 PathProgramCache]: Analyzing trace with hash -659775116, now seen corresponding path program 2 times [2019-12-18 22:03:04,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:04,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721868989] [2019-12-18 22:03:04,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:05,139 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:05,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721868989] [2019-12-18 22:03:05,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:05,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 22:03:05,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292539655] [2019-12-18 22:03:05,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 22:03:05,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 22:03:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:03:05,141 INFO L87 Difference]: Start difference. First operand 57739 states and 148369 transitions. Second operand 18 states. [2019-12-18 22:03:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:14,111 INFO L93 Difference]: Finished difference Result 72619 states and 184899 transitions. [2019-12-18 22:03:14,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-18 22:03:14,112 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-18 22:03:14,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:14,202 INFO L225 Difference]: With dead ends: 72619 [2019-12-18 22:03:14,202 INFO L226 Difference]: Without dead ends: 71584 [2019-12-18 22:03:14,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=584, Invalid=4528, Unknown=0, NotChecked=0, Total=5112 [2019-12-18 22:03:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71584 states. [2019-12-18 22:03:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71584 to 59827. [2019-12-18 22:03:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59827 states. [2019-12-18 22:03:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59827 states to 59827 states and 153741 transitions. [2019-12-18 22:03:15,017 INFO L78 Accepts]: Start accepts. Automaton has 59827 states and 153741 transitions. Word has length 98 [2019-12-18 22:03:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:15,017 INFO L462 AbstractCegarLoop]: Abstraction has 59827 states and 153741 transitions. [2019-12-18 22:03:15,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 22:03:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 59827 states and 153741 transitions. [2019-12-18 22:03:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:03:15,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:15,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:15,080 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:03:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 918766924, now seen corresponding path program 3 times [2019-12-18 22:03:15,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:15,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031843131] [2019-12-18 22:03:15,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:16,278 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:16,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031843131] [2019-12-18 22:03:16,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:16,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-18 22:03:16,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44237942] [2019-12-18 22:03:16,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 22:03:16,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:16,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 22:03:16,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:03:16,280 INFO L87 Difference]: Start difference. First operand 59827 states and 153741 transitions. Second operand 25 states. Received shutdown request... [2019-12-18 22:03:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-18 22:03:27,102 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 22:03:27,107 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 22:03:27,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:03:27 BasicIcfg [2019-12-18 22:03:27,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:03:27,108 INFO L168 Benchmark]: Toolchain (without parser) took 223256.78 ms. Allocated memory was 147.8 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 103.9 MB in the beginning and 697.5 MB in the end (delta: -593.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 22:03:27,109 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:03:27,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.32 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 103.5 MB in the beginning and 154.9 MB in the end (delta: -51.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:27,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.93 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 151.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:27,110 INFO L168 Benchmark]: Boogie Preprocessor took 74.78 ms. Allocated memory is still 203.9 MB. Free memory was 151.2 MB in the beginning and 148.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:27,110 INFO L168 Benchmark]: RCFGBuilder took 1032.57 ms. Allocated memory was 203.9 MB in the beginning and 234.4 MB in the end (delta: 30.4 MB). Free memory was 148.1 MB in the beginning and 185.3 MB in the end (delta: -37.1 MB). Peak memory consumption was 60.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:27,111 INFO L168 Benchmark]: TraceAbstraction took 221089.00 ms. Allocated memory was 234.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 185.3 MB in the beginning and 697.5 MB in the end (delta: -512.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 22:03:27,113 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.49 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 935.32 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 103.5 MB in the beginning and 154.9 MB in the end (delta: -51.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 119.93 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 151.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.78 ms. Allocated memory is still 203.9 MB. Free memory was 151.2 MB in the beginning and 148.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1032.57 ms. Allocated memory was 203.9 MB in the beginning and 234.4 MB in the end (delta: 30.4 MB). Free memory was 148.1 MB in the beginning and 185.3 MB in the end (delta: -37.1 MB). Peak memory consumption was 60.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221089.00 ms. Allocated memory was 234.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 185.3 MB in the beginning and 697.5 MB in the end (delta: -512.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 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 (59827states) and FLOYD_HOARE automaton (currently 86 states, 25 states before enhancement),while ReachableStatesComputation was computing reachable states (80743 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 (59827states) and FLOYD_HOARE automaton (currently 86 states, 25 states before enhancement),while ReachableStatesComputation was computing reachable states (80743 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 220.8s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 136.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 19631 SDtfs, 35780 SDslu, 117550 SDs, 0 SdLazy, 101038 SolverSat, 2362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1340 GetRequests, 138 SyntacticMatches, 82 SemanticMatches, 1120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19240 ImplicationChecksByTransitivity, 28.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189697occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 264216 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1589584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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