/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:06:51,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:06:51,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:06:51,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:06:51,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:06:51,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:06:51,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:06:51,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:06:51,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:06:51,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:06:51,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:06:51,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:06:51,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:06:51,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:06:51,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:06:51,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:06:51,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:06:51,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:06:51,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:06:51,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:06:51,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:06:51,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:06:51,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:06:51,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:06:51,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:06:51,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:06:51,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:06:51,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:06:51,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:06:51,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:06:51,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:06:51,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:06:51,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:06:51,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:06:51,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:06:51,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:06:51,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:06:51,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:06:51,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:06:51,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:06:51,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:06:51,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:06:51,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:06:51,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:06:51,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:06:51,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:06:51,450 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:06:51,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:06:51,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:06:51,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:06:51,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:06:51,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:06:51,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:06:51,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:06:51,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:06:51,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:06:51,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:06:51,457 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:06:51,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:06:51,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:06:51,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:06:51,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:06:51,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:06:51,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:06:51,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:06:51,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:06:51,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:06:51,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:06:51,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:06:51,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:06:51,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:06:51,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:06:51,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:06:51,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:06:51,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:06:51,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:06:51,771 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:06:51,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i [2019-12-18 13:06:51,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9445a116/9459e14981d848a6adfaf362cc0a0159/FLAGf65e2a37c [2019-12-18 13:06:52,344 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:06:52,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i [2019-12-18 13:06:52,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9445a116/9459e14981d848a6adfaf362cc0a0159/FLAGf65e2a37c [2019-12-18 13:06:52,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9445a116/9459e14981d848a6adfaf362cc0a0159 [2019-12-18 13:06:52,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:06:52,651 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:06:52,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:06:52,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:06:52,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:06:52,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:06:52" (1/1) ... [2019-12-18 13:06:52,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1edfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:52, skipping insertion in model container [2019-12-18 13:06:52,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:06:52" (1/1) ... [2019-12-18 13:06:52,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:06:52,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:06:53,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:06:53,326 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:06:53,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:06:53,471 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:06:53,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53 WrapperNode [2019-12-18 13:06:53,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:06:53,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:06:53,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:06:53,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:06:53,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:06:53,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:06:53,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:06:53,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:06:53,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (1/1) ... [2019-12-18 13:06:53,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:06:53,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:06:53,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:06:53,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:06:53,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (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 13:06:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:06:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:06:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:06:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:06:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:06:53,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:06:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:06:53,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:06:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:06:53,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:06:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:06:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:06:53,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:06:53,697 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 13:06:54,769 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:06:54,770 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:06:54,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:06:54 BoogieIcfgContainer [2019-12-18 13:06:54,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:06:54,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:06:54,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:06:54,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:06:54,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:06:52" (1/3) ... [2019-12-18 13:06:54,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733f9d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:06:54, skipping insertion in model container [2019-12-18 13:06:54,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:53" (2/3) ... [2019-12-18 13:06:54,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733f9d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:06:54, skipping insertion in model container [2019-12-18 13:06:54,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:06:54" (3/3) ... [2019-12-18 13:06:54,780 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.oepc.i [2019-12-18 13:06:54,790 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:06:54,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:06:54,798 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:06:54,799 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:06:54,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,838 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,838 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,848 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,848 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,848 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,848 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,849 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,881 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,882 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,884 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:54,907 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:06:54,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:06:54,931 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:06:54,931 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:06:54,932 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:06:54,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:06:54,932 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:06:54,932 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:06:54,932 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:06:54,949 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-18 13:06:54,951 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-18 13:06:55,079 INFO L126 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-18 13:06:55,080 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:06:55,108 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 9/199 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 13:06:55,147 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-18 13:06:55,242 INFO L126 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-18 13:06:55,242 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:06:55,256 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 9/199 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 13:06:55,292 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-18 13:06:55,293 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:07:00,677 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 13:07:01,091 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:07:01,231 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:07:01,377 INFO L206 etLargeBlockEncoding]: Checked pairs total: 165402 [2019-12-18 13:07:01,378 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 13:07:01,381 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 143 transitions [2019-12-18 13:07:06,078 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 57466 states. [2019-12-18 13:07:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 57466 states. [2019-12-18 13:07:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:07:06,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:06,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:06,089 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash -953839885, now seen corresponding path program 1 times [2019-12-18 13:07:06,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:06,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904992508] [2019-12-18 13:07:06,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:06,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904992508] [2019-12-18 13:07:06,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:06,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:07:06,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142859326] [2019-12-18 13:07:06,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:06,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:06,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:06,410 INFO L87 Difference]: Start difference. First operand 57466 states. Second operand 3 states. [2019-12-18 13:07:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:08,250 INFO L93 Difference]: Finished difference Result 57370 states and 231250 transitions. [2019-12-18 13:07:08,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:08,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:07:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:08,737 INFO L225 Difference]: With dead ends: 57370 [2019-12-18 13:07:08,737 INFO L226 Difference]: Without dead ends: 56226 [2019-12-18 13:07:08,739 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 13:07:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56226 states. [2019-12-18 13:07:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56226 to 56226. [2019-12-18 13:07:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56226 states. [2019-12-18 13:07:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56226 states to 56226 states and 226882 transitions. [2019-12-18 13:07:13,751 INFO L78 Accepts]: Start accepts. Automaton has 56226 states and 226882 transitions. Word has length 7 [2019-12-18 13:07:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:13,752 INFO L462 AbstractCegarLoop]: Abstraction has 56226 states and 226882 transitions. [2019-12-18 13:07:13,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 56226 states and 226882 transitions. [2019-12-18 13:07:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:07:13,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:13,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:13,760 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash 749632042, now seen corresponding path program 1 times [2019-12-18 13:07:13,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:13,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053046792] [2019-12-18 13:07:13,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:13,902 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 13:07:13,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053046792] [2019-12-18 13:07:13,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:13,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:13,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454207065] [2019-12-18 13:07:13,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:13,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:13,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:13,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:13,906 INFO L87 Difference]: Start difference. First operand 56226 states and 226882 transitions. Second operand 4 states. [2019-12-18 13:07:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:14,716 INFO L93 Difference]: Finished difference Result 90514 states and 350820 transitions. [2019-12-18 13:07:14,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:07:14,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:07:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:15,748 INFO L225 Difference]: With dead ends: 90514 [2019-12-18 13:07:15,748 INFO L226 Difference]: Without dead ends: 90500 [2019-12-18 13:07:15,749 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 13:07:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90500 states. [2019-12-18 13:07:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90500 to 87886. [2019-12-18 13:07:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87886 states. [2019-12-18 13:07:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87886 states to 87886 states and 342542 transitions. [2019-12-18 13:07:23,640 INFO L78 Accepts]: Start accepts. Automaton has 87886 states and 342542 transitions. Word has length 13 [2019-12-18 13:07:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:23,640 INFO L462 AbstractCegarLoop]: Abstraction has 87886 states and 342542 transitions. [2019-12-18 13:07:23,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:07:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 87886 states and 342542 transitions. [2019-12-18 13:07:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:07:23,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:23,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:23,643 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:23,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1969493490, now seen corresponding path program 1 times [2019-12-18 13:07:23,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:23,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811406699] [2019-12-18 13:07:23,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:23,696 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 13:07:23,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811406699] [2019-12-18 13:07:23,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:23,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:23,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998101165] [2019-12-18 13:07:23,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:23,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:23,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:23,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:23,699 INFO L87 Difference]: Start difference. First operand 87886 states and 342542 transitions. Second operand 3 states. [2019-12-18 13:07:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:23,886 INFO L93 Difference]: Finished difference Result 48011 states and 163167 transitions. [2019-12-18 13:07:23,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:23,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:07:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:24,004 INFO L225 Difference]: With dead ends: 48011 [2019-12-18 13:07:24,005 INFO L226 Difference]: Without dead ends: 48011 [2019-12-18 13:07:24,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:07:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48011 states. [2019-12-18 13:07:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48011 to 48011. [2019-12-18 13:07:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48011 states. [2019-12-18 13:07:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48011 states to 48011 states and 163167 transitions. [2019-12-18 13:07:26,066 INFO L78 Accepts]: Start accepts. Automaton has 48011 states and 163167 transitions. Word has length 13 [2019-12-18 13:07:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:26,066 INFO L462 AbstractCegarLoop]: Abstraction has 48011 states and 163167 transitions. [2019-12-18 13:07:26,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 48011 states and 163167 transitions. [2019-12-18 13:07:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:07:26,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:26,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:26,068 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:26,068 INFO L82 PathProgramCache]: Analyzing trace with hash 802741009, now seen corresponding path program 1 times [2019-12-18 13:07:26,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:26,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711552177] [2019-12-18 13:07:26,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:26,116 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 13:07:26,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711552177] [2019-12-18 13:07:26,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:26,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:07:26,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145917388] [2019-12-18 13:07:26,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:26,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:26,119 INFO L87 Difference]: Start difference. First operand 48011 states and 163167 transitions. Second operand 4 states. [2019-12-18 13:07:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:26,161 INFO L93 Difference]: Finished difference Result 5081 states and 12972 transitions. [2019-12-18 13:07:26,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:07:26,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:07:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:26,171 INFO L225 Difference]: With dead ends: 5081 [2019-12-18 13:07:26,171 INFO L226 Difference]: Without dead ends: 5081 [2019-12-18 13:07:26,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2019-12-18 13:07:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5081. [2019-12-18 13:07:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2019-12-18 13:07:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 12972 transitions. [2019-12-18 13:07:26,257 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 12972 transitions. Word has length 14 [2019-12-18 13:07:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:26,258 INFO L462 AbstractCegarLoop]: Abstraction has 5081 states and 12972 transitions. [2019-12-18 13:07:26,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:07:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 12972 transitions. [2019-12-18 13:07:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:07:26,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:26,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:26,262 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1593078696, now seen corresponding path program 1 times [2019-12-18 13:07:26,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:26,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753149478] [2019-12-18 13:07:26,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:26,361 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 13:07:26,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753149478] [2019-12-18 13:07:26,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:26,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:07:26,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018869118] [2019-12-18 13:07:26,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:07:26,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:26,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:07:26,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:07:26,364 INFO L87 Difference]: Start difference. First operand 5081 states and 12972 transitions. Second operand 5 states. [2019-12-18 13:07:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:26,400 INFO L93 Difference]: Finished difference Result 1979 states and 5224 transitions. [2019-12-18 13:07:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:07:26,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:07:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:26,406 INFO L225 Difference]: With dead ends: 1979 [2019-12-18 13:07:26,406 INFO L226 Difference]: Without dead ends: 1979 [2019-12-18 13:07:26,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:07:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-18 13:07:26,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1881. [2019-12-18 13:07:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-18 13:07:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4993 transitions. [2019-12-18 13:07:26,447 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4993 transitions. Word has length 26 [2019-12-18 13:07:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:26,448 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4993 transitions. [2019-12-18 13:07:26,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:07:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4993 transitions. [2019-12-18 13:07:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 13:07:26,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:26,457 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 13:07:26,457 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash 76160980, now seen corresponding path program 1 times [2019-12-18 13:07:26,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:26,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649712534] [2019-12-18 13:07:26,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:26,728 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 13:07:26,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649712534] [2019-12-18 13:07:26,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:26,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:07:26,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218705414] [2019-12-18 13:07:26,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:07:26,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:07:26,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:07:26,734 INFO L87 Difference]: Start difference. First operand 1881 states and 4993 transitions. Second operand 5 states. [2019-12-18 13:07:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:27,302 INFO L93 Difference]: Finished difference Result 2818 states and 7401 transitions. [2019-12-18 13:07:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:07:27,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-18 13:07:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:27,308 INFO L225 Difference]: With dead ends: 2818 [2019-12-18 13:07:27,308 INFO L226 Difference]: Without dead ends: 2818 [2019-12-18 13:07:27,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-18 13:07:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2057. [2019-12-18 13:07:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2019-12-18 13:07:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 5485 transitions. [2019-12-18 13:07:27,345 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 5485 transitions. Word has length 71 [2019-12-18 13:07:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:27,345 INFO L462 AbstractCegarLoop]: Abstraction has 2057 states and 5485 transitions. [2019-12-18 13:07:27,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:07:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 5485 transitions. [2019-12-18 13:07:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 13:07:27,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:27,351 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 13:07:27,351 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash -789175518, now seen corresponding path program 2 times [2019-12-18 13:07:27,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:27,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936835089] [2019-12-18 13:07:27,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:27,521 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 13:07:27,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936835089] [2019-12-18 13:07:27,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:27,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:07:27,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972000736] [2019-12-18 13:07:27,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:27,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:27,524 INFO L87 Difference]: Start difference. First operand 2057 states and 5485 transitions. Second operand 7 states. [2019-12-18 13:07:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:28,747 INFO L93 Difference]: Finished difference Result 2346 states and 6185 transitions. [2019-12-18 13:07:28,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:07:28,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-18 13:07:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:28,753 INFO L225 Difference]: With dead ends: 2346 [2019-12-18 13:07:28,753 INFO L226 Difference]: Without dead ends: 2346 [2019-12-18 13:07:28,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:07:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-12-18 13:07:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2127. [2019-12-18 13:07:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-18 13:07:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 5650 transitions. [2019-12-18 13:07:28,787 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 5650 transitions. Word has length 71 [2019-12-18 13:07:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:28,787 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 5650 transitions. [2019-12-18 13:07:28,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 5650 transitions. [2019-12-18 13:07:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 13:07:28,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:28,794 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 13:07:28,794 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash 920625250, now seen corresponding path program 3 times [2019-12-18 13:07:28,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:28,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983076249] [2019-12-18 13:07:28,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:28,903 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 13:07:28,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983076249] [2019-12-18 13:07:28,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:28,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:07:28,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955255427] [2019-12-18 13:07:28,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:07:28,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:28,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:07:28,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:07:28,905 INFO L87 Difference]: Start difference. First operand 2127 states and 5650 transitions. Second operand 6 states. [2019-12-18 13:07:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:29,412 INFO L93 Difference]: Finished difference Result 3285 states and 8595 transitions. [2019-12-18 13:07:29,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:07:29,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-18 13:07:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:29,418 INFO L225 Difference]: With dead ends: 3285 [2019-12-18 13:07:29,418 INFO L226 Difference]: Without dead ends: 3285 [2019-12-18 13:07:29,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-12-18 13:07:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2411. [2019-12-18 13:07:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-18 13:07:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6298 transitions. [2019-12-18 13:07:29,460 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6298 transitions. Word has length 71 [2019-12-18 13:07:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:29,461 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 6298 transitions. [2019-12-18 13:07:29,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:07:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6298 transitions. [2019-12-18 13:07:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 13:07:29,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:29,466 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 13:07:29,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:29,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:29,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1439498402, now seen corresponding path program 1 times [2019-12-18 13:07:29,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:29,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467657135] [2019-12-18 13:07:29,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:29,612 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 13:07:29,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467657135] [2019-12-18 13:07:29,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:29,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:07:29,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339864650] [2019-12-18 13:07:29,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:07:29,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:07:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:07:29,615 INFO L87 Difference]: Start difference. First operand 2411 states and 6298 transitions. Second operand 8 states. [2019-12-18 13:07:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:30,422 INFO L93 Difference]: Finished difference Result 4056 states and 10526 transitions. [2019-12-18 13:07:30,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:07:30,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-12-18 13:07:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:30,430 INFO L225 Difference]: With dead ends: 4056 [2019-12-18 13:07:30,430 INFO L226 Difference]: Without dead ends: 4056 [2019-12-18 13:07:30,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:07:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-18 13:07:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2423. [2019-12-18 13:07:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-18 13:07:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 6326 transitions. [2019-12-18 13:07:30,479 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 6326 transitions. Word has length 72 [2019-12-18 13:07:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:30,479 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 6326 transitions. [2019-12-18 13:07:30,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:07:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 6326 transitions. [2019-12-18 13:07:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 13:07:30,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:30,485 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 13:07:30,485 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:30,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:30,485 INFO L82 PathProgramCache]: Analyzing trace with hash 362991256, now seen corresponding path program 2 times [2019-12-18 13:07:30,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:30,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111269543] [2019-12-18 13:07:30,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:30,666 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 13:07:30,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111269543] [2019-12-18 13:07:30,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:30,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:07:30,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367062834] [2019-12-18 13:07:30,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:07:30,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:07:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:07:30,669 INFO L87 Difference]: Start difference. First operand 2423 states and 6326 transitions. Second operand 8 states. [2019-12-18 13:07:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:31,521 INFO L93 Difference]: Finished difference Result 4529 states and 11696 transitions. [2019-12-18 13:07:31,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:07:31,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-12-18 13:07:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:31,529 INFO L225 Difference]: With dead ends: 4529 [2019-12-18 13:07:31,529 INFO L226 Difference]: Without dead ends: 4529 [2019-12-18 13:07:31,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:07:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2019-12-18 13:07:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 2513. [2019-12-18 13:07:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-12-18 13:07:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 6593 transitions. [2019-12-18 13:07:31,571 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 6593 transitions. Word has length 72 [2019-12-18 13:07:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:31,572 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 6593 transitions. [2019-12-18 13:07:31,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:07:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 6593 transitions. [2019-12-18 13:07:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 13:07:31,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:31,577 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 13:07:31,578 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash -697994534, now seen corresponding path program 3 times [2019-12-18 13:07:31,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:31,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240581259] [2019-12-18 13:07:31,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:31,719 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 13:07:31,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240581259] [2019-12-18 13:07:31,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:31,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:07:31,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816870562] [2019-12-18 13:07:31,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:07:31,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:07:31,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:07:31,721 INFO L87 Difference]: Start difference. First operand 2513 states and 6593 transitions. Second operand 8 states. [2019-12-18 13:07:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:32,409 INFO L93 Difference]: Finished difference Result 4357 states and 11298 transitions. [2019-12-18 13:07:32,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:07:32,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-12-18 13:07:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:32,416 INFO L225 Difference]: With dead ends: 4357 [2019-12-18 13:07:32,416 INFO L226 Difference]: Without dead ends: 4357 [2019-12-18 13:07:32,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:07:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2019-12-18 13:07:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 2495. [2019-12-18 13:07:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2019-12-18 13:07:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 6548 transitions. [2019-12-18 13:07:32,468 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 6548 transitions. Word has length 72 [2019-12-18 13:07:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:32,469 INFO L462 AbstractCegarLoop]: Abstraction has 2495 states and 6548 transitions. [2019-12-18 13:07:32,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:07:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 6548 transitions. [2019-12-18 13:07:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 13:07:32,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:32,475 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 13:07:32,475 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2080066259, now seen corresponding path program 1 times [2019-12-18 13:07:32,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:32,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40805332] [2019-12-18 13:07:32,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:32,561 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 13:07:32,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40805332] [2019-12-18 13:07:32,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:32,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:07:32,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401718377] [2019-12-18 13:07:32,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:07:32,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:32,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:07:32,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:07:32,563 INFO L87 Difference]: Start difference. First operand 2495 states and 6548 transitions. Second operand 6 states. [2019-12-18 13:07:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:33,163 INFO L93 Difference]: Finished difference Result 3310 states and 8595 transitions. [2019-12-18 13:07:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:07:33,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-12-18 13:07:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:33,168 INFO L225 Difference]: With dead ends: 3310 [2019-12-18 13:07:33,169 INFO L226 Difference]: Without dead ends: 3310 [2019-12-18 13:07:33,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 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 13:07:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-12-18 13:07:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 2691. [2019-12-18 13:07:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2691 states. [2019-12-18 13:07:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 7052 transitions. [2019-12-18 13:07:33,219 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 7052 transitions. Word has length 72 [2019-12-18 13:07:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:33,219 INFO L462 AbstractCegarLoop]: Abstraction has 2691 states and 7052 transitions. [2019-12-18 13:07:33,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:07:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 7052 transitions. [2019-12-18 13:07:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 13:07:33,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:33,225 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 13:07:33,225 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1499063086, now seen corresponding path program 1 times [2019-12-18 13:07:33,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:33,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789150868] [2019-12-18 13:07:33,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:33,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789150868] [2019-12-18 13:07:33,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:33,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:07:33,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275209606] [2019-12-18 13:07:33,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:33,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:33,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:33,356 INFO L87 Difference]: Start difference. First operand 2691 states and 7052 transitions. Second operand 7 states. [2019-12-18 13:07:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:33,963 INFO L93 Difference]: Finished difference Result 3423 states and 8847 transitions. [2019-12-18 13:07:33,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:07:33,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-18 13:07:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:33,969 INFO L225 Difference]: With dead ends: 3423 [2019-12-18 13:07:33,970 INFO L226 Difference]: Without dead ends: 3423 [2019-12-18 13:07:33,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:07:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2019-12-18 13:07:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 2523. [2019-12-18 13:07:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-12-18 13:07:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 6614 transitions. [2019-12-18 13:07:34,006 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 6614 transitions. Word has length 72 [2019-12-18 13:07:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:34,007 INFO L462 AbstractCegarLoop]: Abstraction has 2523 states and 6614 transitions. [2019-12-18 13:07:34,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 6614 transitions. [2019-12-18 13:07:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:34,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:34,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:34,013 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash -298102113, now seen corresponding path program 1 times [2019-12-18 13:07:34,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:34,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540218835] [2019-12-18 13:07:34,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:34,084 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 13:07:34,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540218835] [2019-12-18 13:07:34,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:34,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:34,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349921772] [2019-12-18 13:07:34,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:34,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:34,086 INFO L87 Difference]: Start difference. First operand 2523 states and 6614 transitions. Second operand 3 states. [2019-12-18 13:07:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:34,104 INFO L93 Difference]: Finished difference Result 2291 states and 5860 transitions. [2019-12-18 13:07:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:34,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-18 13:07:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:34,108 INFO L225 Difference]: With dead ends: 2291 [2019-12-18 13:07:34,109 INFO L226 Difference]: Without dead ends: 2291 [2019-12-18 13:07:34,109 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 13:07:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-12-18 13:07:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-12-18 13:07:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-18 13:07:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 5860 transitions. [2019-12-18 13:07:34,143 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 5860 transitions. Word has length 73 [2019-12-18 13:07:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:34,144 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 5860 transitions. [2019-12-18 13:07:34,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 5860 transitions. [2019-12-18 13:07:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:34,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:34,149 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 13:07:34,149 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash -393402248, now seen corresponding path program 1 times [2019-12-18 13:07:34,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:34,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476588264] [2019-12-18 13:07:34,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:34,220 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 13:07:34,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476588264] [2019-12-18 13:07:34,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:34,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:34,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880048537] [2019-12-18 13:07:34,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:34,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:34,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:34,222 INFO L87 Difference]: Start difference. First operand 2291 states and 5860 transitions. Second operand 3 states. [2019-12-18 13:07:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:34,269 INFO L93 Difference]: Finished difference Result 2290 states and 5858 transitions. [2019-12-18 13:07:34,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:34,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-18 13:07:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:34,274 INFO L225 Difference]: With dead ends: 2290 [2019-12-18 13:07:34,274 INFO L226 Difference]: Without dead ends: 2290 [2019-12-18 13:07:34,275 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 13:07:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-12-18 13:07:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2025. [2019-12-18 13:07:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-12-18 13:07:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 5244 transitions. [2019-12-18 13:07:34,316 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 5244 transitions. Word has length 73 [2019-12-18 13:07:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:34,317 INFO L462 AbstractCegarLoop]: Abstraction has 2025 states and 5244 transitions. [2019-12-18 13:07:34,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 5244 transitions. [2019-12-18 13:07:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:34,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:34,323 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 13:07:34,323 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1480966909, now seen corresponding path program 1 times [2019-12-18 13:07:34,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:34,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474518543] [2019-12-18 13:07:34,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:34,528 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 13:07:34,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474518543] [2019-12-18 13:07:34,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:34,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:07:34,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291513487] [2019-12-18 13:07:34,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:34,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:34,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:34,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:34,532 INFO L87 Difference]: Start difference. First operand 2025 states and 5244 transitions. Second operand 7 states. [2019-12-18 13:07:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:34,969 INFO L93 Difference]: Finished difference Result 3018 states and 7764 transitions. [2019-12-18 13:07:34,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:07:34,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-18 13:07:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:34,974 INFO L225 Difference]: With dead ends: 3018 [2019-12-18 13:07:34,974 INFO L226 Difference]: Without dead ends: 3018 [2019-12-18 13:07:34,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-12-18 13:07:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2401. [2019-12-18 13:07:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-12-18 13:07:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 6240 transitions. [2019-12-18 13:07:35,003 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 6240 transitions. Word has length 73 [2019-12-18 13:07:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:35,003 INFO L462 AbstractCegarLoop]: Abstraction has 2401 states and 6240 transitions. [2019-12-18 13:07:35,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 6240 transitions. [2019-12-18 13:07:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:35,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:35,007 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 13:07:35,007 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2120547763, now seen corresponding path program 2 times [2019-12-18 13:07:35,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:35,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169150341] [2019-12-18 13:07:35,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:35,143 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 13:07:35,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169150341] [2019-12-18 13:07:35,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:35,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:07:35,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148684053] [2019-12-18 13:07:35,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:07:35,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:07:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:07:35,145 INFO L87 Difference]: Start difference. First operand 2401 states and 6240 transitions. Second operand 6 states. [2019-12-18 13:07:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:35,470 INFO L93 Difference]: Finished difference Result 2921 states and 7624 transitions. [2019-12-18 13:07:35,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:07:35,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-18 13:07:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:35,475 INFO L225 Difference]: With dead ends: 2921 [2019-12-18 13:07:35,475 INFO L226 Difference]: Without dead ends: 2921 [2019-12-18 13:07:35,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2019-12-18 13:07:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2695. [2019-12-18 13:07:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-12-18 13:07:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 7043 transitions. [2019-12-18 13:07:35,504 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 7043 transitions. Word has length 73 [2019-12-18 13:07:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:35,504 INFO L462 AbstractCegarLoop]: Abstraction has 2695 states and 7043 transitions. [2019-12-18 13:07:35,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:07:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 7043 transitions. [2019-12-18 13:07:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:35,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:35,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:35,508 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:35,509 INFO L82 PathProgramCache]: Analyzing trace with hash -524687625, now seen corresponding path program 3 times [2019-12-18 13:07:35,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:35,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501994910] [2019-12-18 13:07:35,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:35,659 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 13:07:35,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501994910] [2019-12-18 13:07:35,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:35,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:07:35,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080597662] [2019-12-18 13:07:35,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:35,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:35,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:35,661 INFO L87 Difference]: Start difference. First operand 2695 states and 7043 transitions. Second operand 7 states. [2019-12-18 13:07:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:36,051 INFO L93 Difference]: Finished difference Result 3251 states and 8393 transitions. [2019-12-18 13:07:36,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:07:36,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-18 13:07:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:36,057 INFO L225 Difference]: With dead ends: 3251 [2019-12-18 13:07:36,057 INFO L226 Difference]: Without dead ends: 3251 [2019-12-18 13:07:36,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:07:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2019-12-18 13:07:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2455. [2019-12-18 13:07:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2455 states. [2019-12-18 13:07:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 6393 transitions. [2019-12-18 13:07:36,089 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 6393 transitions. Word has length 73 [2019-12-18 13:07:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:36,089 INFO L462 AbstractCegarLoop]: Abstraction has 2455 states and 6393 transitions. [2019-12-18 13:07:36,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 6393 transitions. [2019-12-18 13:07:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:36,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:36,092 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 13:07:36,093 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1787574207, now seen corresponding path program 4 times [2019-12-18 13:07:36,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:36,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558806795] [2019-12-18 13:07:36,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:36,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558806795] [2019-12-18 13:07:36,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:36,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:07:36,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231742894] [2019-12-18 13:07:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:36,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:36,250 INFO L87 Difference]: Start difference. First operand 2455 states and 6393 transitions. Second operand 7 states. [2019-12-18 13:07:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:36,656 INFO L93 Difference]: Finished difference Result 4116 states and 10645 transitions. [2019-12-18 13:07:36,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:07:36,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-18 13:07:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:36,663 INFO L225 Difference]: With dead ends: 4116 [2019-12-18 13:07:36,663 INFO L226 Difference]: Without dead ends: 4116 [2019-12-18 13:07:36,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:07:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2019-12-18 13:07:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 2463. [2019-12-18 13:07:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-18 13:07:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 6413 transitions. [2019-12-18 13:07:36,713 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 6413 transitions. Word has length 73 [2019-12-18 13:07:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:36,714 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 6413 transitions. [2019-12-18 13:07:36,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 6413 transitions. [2019-12-18 13:07:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:36,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:36,719 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 13:07:36,719 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash 109680953, now seen corresponding path program 5 times [2019-12-18 13:07:36,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:36,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054573049] [2019-12-18 13:07:36,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:36,889 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 13:07:36,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054573049] [2019-12-18 13:07:36,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:36,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:07:36,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904131843] [2019-12-18 13:07:36,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:36,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:36,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:36,891 INFO L87 Difference]: Start difference. First operand 2463 states and 6413 transitions. Second operand 7 states. [2019-12-18 13:07:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:37,293 INFO L93 Difference]: Finished difference Result 2881 states and 7484 transitions. [2019-12-18 13:07:37,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:07:37,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-18 13:07:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:37,298 INFO L225 Difference]: With dead ends: 2881 [2019-12-18 13:07:37,299 INFO L226 Difference]: Without dead ends: 2881 [2019-12-18 13:07:37,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:37,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2019-12-18 13:07:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2603. [2019-12-18 13:07:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2019-12-18 13:07:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 6769 transitions. [2019-12-18 13:07:37,329 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 6769 transitions. Word has length 73 [2019-12-18 13:07:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:37,330 INFO L462 AbstractCegarLoop]: Abstraction has 2603 states and 6769 transitions. [2019-12-18 13:07:37,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 6769 transitions. [2019-12-18 13:07:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:37,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:37,334 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 13:07:37,334 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1705541091, now seen corresponding path program 6 times [2019-12-18 13:07:37,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:37,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801164199] [2019-12-18 13:07:37,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:37,570 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 13:07:37,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801164199] [2019-12-18 13:07:37,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:37,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:07:37,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923357518] [2019-12-18 13:07:37,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:07:37,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:07:37,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:07:37,573 INFO L87 Difference]: Start difference. First operand 2603 states and 6769 transitions. Second operand 10 states. [2019-12-18 13:07:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:38,523 INFO L93 Difference]: Finished difference Result 5087 states and 13201 transitions. [2019-12-18 13:07:38,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:07:38,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-18 13:07:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:38,531 INFO L225 Difference]: With dead ends: 5087 [2019-12-18 13:07:38,531 INFO L226 Difference]: Without dead ends: 5087 [2019-12-18 13:07:38,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:07:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5087 states. [2019-12-18 13:07:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5087 to 3371. [2019-12-18 13:07:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2019-12-18 13:07:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 8855 transitions. [2019-12-18 13:07:38,583 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 8855 transitions. Word has length 73 [2019-12-18 13:07:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:38,583 INFO L462 AbstractCegarLoop]: Abstraction has 3371 states and 8855 transitions. [2019-12-18 13:07:38,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:07:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 8855 transitions. [2019-12-18 13:07:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 13:07:38,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:38,589 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 13:07:38,589 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:38,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1431998849, now seen corresponding path program 7 times [2019-12-18 13:07:38,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:38,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809211301] [2019-12-18 13:07:38,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:38,824 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 13:07:38,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809211301] [2019-12-18 13:07:38,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:38,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:07:38,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075390571] [2019-12-18 13:07:38,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:07:38,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:07:38,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:07:38,826 INFO L87 Difference]: Start difference. First operand 3371 states and 8855 transitions. Second operand 10 states. [2019-12-18 13:07:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:39,844 INFO L93 Difference]: Finished difference Result 5898 states and 15308 transitions. [2019-12-18 13:07:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:07:39,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-18 13:07:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:39,854 INFO L225 Difference]: With dead ends: 5898 [2019-12-18 13:07:39,854 INFO L226 Difference]: Without dead ends: 5898 [2019-12-18 13:07:39,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:07:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2019-12-18 13:07:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 2923. [2019-12-18 13:07:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-12-18 13:07:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 7691 transitions. [2019-12-18 13:07:39,912 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 7691 transitions. Word has length 73 [2019-12-18 13:07:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:39,912 INFO L462 AbstractCegarLoop]: Abstraction has 2923 states and 7691 transitions. [2019-12-18 13:07:39,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:07:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 7691 transitions. [2019-12-18 13:07:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:07:39,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:39,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] [2019-12-18 13:07:39,917 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash 95378273, now seen corresponding path program 1 times [2019-12-18 13:07:39,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:39,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318853580] [2019-12-18 13:07:39,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:40,059 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 13:07:40,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318853580] [2019-12-18 13:07:40,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:40,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:07:40,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768639980] [2019-12-18 13:07:40,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:07:40,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:07:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:07:40,066 INFO L87 Difference]: Start difference. First operand 2923 states and 7691 transitions. Second operand 6 states. [2019-12-18 13:07:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:40,200 INFO L93 Difference]: Finished difference Result 4671 states and 11555 transitions. [2019-12-18 13:07:40,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:07:40,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 13:07:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:40,204 INFO L225 Difference]: With dead ends: 4671 [2019-12-18 13:07:40,204 INFO L226 Difference]: Without dead ends: 1976 [2019-12-18 13:07:40,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2019-12-18 13:07:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1672. [2019-12-18 13:07:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-12-18 13:07:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 3706 transitions. [2019-12-18 13:07:40,234 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 3706 transitions. Word has length 74 [2019-12-18 13:07:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:40,234 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 3706 transitions. [2019-12-18 13:07:40,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:07:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 3706 transitions. [2019-12-18 13:07:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:07:40,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:40,237 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] [2019-12-18 13:07:40,240 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:40,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1817677093, now seen corresponding path program 2 times [2019-12-18 13:07:40,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:40,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685375870] [2019-12-18 13:07:40,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:40,422 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 13:07:40,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685375870] [2019-12-18 13:07:40,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:40,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:07:40,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738819402] [2019-12-18 13:07:40,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:07:40,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:07:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:07:40,427 INFO L87 Difference]: Start difference. First operand 1672 states and 3706 transitions. Second operand 5 states. [2019-12-18 13:07:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:40,572 INFO L93 Difference]: Finished difference Result 2048 states and 4486 transitions. [2019-12-18 13:07:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:07:40,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-18 13:07:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:40,574 INFO L225 Difference]: With dead ends: 2048 [2019-12-18 13:07:40,574 INFO L226 Difference]: Without dead ends: 295 [2019-12-18 13:07:40,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 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 13:07:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-18 13:07:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 271. [2019-12-18 13:07:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-18 13:07:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 458 transitions. [2019-12-18 13:07:40,581 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 458 transitions. Word has length 74 [2019-12-18 13:07:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:40,582 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 458 transitions. [2019-12-18 13:07:40,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:07:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 458 transitions. [2019-12-18 13:07:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:07:40,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:40,584 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] [2019-12-18 13:07:40,584 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash -398575509, now seen corresponding path program 3 times [2019-12-18 13:07:40,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:40,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681727158] [2019-12-18 13:07:40,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:40,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681727158] [2019-12-18 13:07:40,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:40,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:07:40,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045096147] [2019-12-18 13:07:40,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:07:40,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:40,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:07:40,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:07:40,925 INFO L87 Difference]: Start difference. First operand 271 states and 458 transitions. Second operand 11 states. [2019-12-18 13:07:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:41,278 INFO L93 Difference]: Finished difference Result 419 states and 701 transitions. [2019-12-18 13:07:41,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:07:41,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-18 13:07:41,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:41,280 INFO L225 Difference]: With dead ends: 419 [2019-12-18 13:07:41,280 INFO L226 Difference]: Without dead ends: 389 [2019-12-18 13:07:41,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:07:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-18 13:07:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 379. [2019-12-18 13:07:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 13:07:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 643 transitions. [2019-12-18 13:07:41,285 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 643 transitions. Word has length 74 [2019-12-18 13:07:41,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:41,286 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 643 transitions. [2019-12-18 13:07:41,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:07:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 643 transitions. [2019-12-18 13:07:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 13:07:41,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:41,287 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] [2019-12-18 13:07:41,287 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:41,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2034928915, now seen corresponding path program 4 times [2019-12-18 13:07:41,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:41,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735867918] [2019-12-18 13:07:41,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:07:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:07:41,436 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:07:41,436 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:07:41,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= v_~y$r_buff1_thd1~0_137 0) (= v_~y$flush_delayed~0_201 0) (= v_~y$r_buff1_thd0~0_323 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd2~0_124) (= v_~y$w_buff1_used~0_443 0) (= 0 v_~y$r_buff1_thd3~0_282) (= 0 v_~y$r_buff0_thd3~0_461) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t763~0.base_27|) (= 0 v_~y$w_buff0~0_180) (= v_~main$tmp_guard1~0_34 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$r_buff1_thd2~0_202) (= v_~y$r_buff0_thd0~0_357 0) (= v_~y$r_buff0_thd1~0_62 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t763~0.base_27| 1)) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y~0_276 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t763~0.base_27| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t763~0.base_27|) 0) (= v_~z~0_23 0) (= v_~weak$$choice2~0_236 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t763~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t763~0.base_27|) |v_ULTIMATE.start_main_~#t763~0.offset_21| 0)) |v_#memory_int_23|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= |v_#NULL.offset_5| 0) (= v_~y$mem_tmp~0_174 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_86) (= 0 v_~__unbuffered_p2_EAX~0_30) (= v_~x~0_36 0) (= v_~y$w_buff0_used~0_864 0) (= |v_ULTIMATE.start_main_~#t763~0.offset_21| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t763~0.base=|v_ULTIMATE.start_main_~#t763~0.base_27|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_27|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_46|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_65|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_30|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_25|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_52|, ~y$mem_tmp~0=v_~y$mem_tmp~0_174, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_282, ULTIMATE.start_main_~#t764~0.offset=|v_ULTIMATE.start_main_~#t764~0.offset_16|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_62, ~y$flush_delayed~0=v_~y$flush_delayed~0_201, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_53|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ULTIMATE.start_main_~#t764~0.base=|v_ULTIMATE.start_main_~#t764~0.base_19|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_76|, ULTIMATE.start_main_~#t765~0.base=|v_ULTIMATE.start_main_~#t765~0.base_18|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_122|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_29|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_44|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_323, ~x~0=v_~x~0_36, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_864, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_65|, ULTIMATE.start_main_~#t765~0.offset=|v_ULTIMATE.start_main_~#t765~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_53|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_55|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_75|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_38|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_137, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_46|, ~y$w_buff0~0=v_~y$w_buff0~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_461, ~y~0=v_~y~0_276, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_25|, ULTIMATE.start_main_~#t763~0.offset=|v_ULTIMATE.start_main_~#t763~0.offset_21|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_36|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_39|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_58|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_84|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_202, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_35|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_43|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_357, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_443} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t763~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t764~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet48, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t764~0.base, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_~#t765~0.base, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t765~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t763~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:07:41,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L818-1-->L820: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t764~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t764~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t764~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t764~0.base_11|) |v_ULTIMATE.start_main_~#t764~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t764~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t764~0.base_11| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t764~0.base_11|)) (= |v_ULTIMATE.start_main_~#t764~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t764~0.offset=|v_ULTIMATE.start_main_~#t764~0.offset_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t764~0.base=|v_ULTIMATE.start_main_~#t764~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t764~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t764~0.base, #length] because there is no mapped edge [2019-12-18 13:07:41,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t765~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t765~0.base_12|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t765~0.base_12| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t765~0.base_12|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t765~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t765~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t765~0.base_12|) |v_ULTIMATE.start_main_~#t765~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t765~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t765~0.offset=|v_ULTIMATE.start_main_~#t765~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t765~0.base=|v_ULTIMATE.start_main_~#t765~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t765~0.offset, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t765~0.base] because there is no mapped edge [2019-12-18 13:07:41,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L4-->L780: Formula: (and (= 1 v_~y$r_buff0_thd3~0_204) (= v_~weak$$choice2~0_87 v_~y$flush_delayed~0_53) (= |v_P2Thread1of1ForFork1_#t~nondet10_46| v_~weak$$choice2~0_87) (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_57) (not (= v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= |v_P2Thread1of1ForFork1_#t~nondet9_46| v_~weak$$choice0~0_41) (= v_~y$r_buff0_thd3~0_205 v_~y$r_buff1_thd3~0_107) (= v_~y~0_105 v_~y$mem_tmp~0_43) (= v_~y$r_buff0_thd0~0_153 v_~y$r_buff1_thd0~0_106) (= v_~y$r_buff0_thd1~0_24 v_~y$r_buff1_thd1~0_24)) InVars {P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_46|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_46|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_105, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8} OutVars{P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_45|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_45|, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_57, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_107, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_204, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~y~0=v_~y~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~nondet10, P2Thread1of1ForFork1_#t~nondet9, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:07:41,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out1557646051| |P2Thread1of1ForFork1_#t~ite12_Out1557646051|)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1557646051 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1557646051 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork1_#t~ite11_Out1557646051| ~y$w_buff0~0_In1557646051)) (and .cse0 (or .cse2 .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out1557646051| ~y$w_buff1~0_In1557646051)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1557646051, ~y$w_buff1~0=~y$w_buff1~0_In1557646051, ~y$w_buff0~0=~y$w_buff0~0_In1557646051, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1557646051} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1557646051, ~y$w_buff1~0=~y$w_buff1~0_In1557646051, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1557646051|, ~y$w_buff0~0=~y$w_buff0~0_In1557646051, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1557646051, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1557646051|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:07:41,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_81 256) 0)) (= v_~y$r_buff0_thd3~0_181 v_~y$r_buff0_thd3~0_180)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_81} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_13|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_12|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_81} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:07:41,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1169402239 256)))) (or (and .cse0 (= ~y~0_In1169402239 |P2Thread1of1ForFork1_#t~ite31_Out1169402239|)) (and (= |P2Thread1of1ForFork1_#t~ite31_Out1169402239| ~y$mem_tmp~0_In1169402239) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1169402239, ~y$flush_delayed~0=~y$flush_delayed~0_In1169402239, ~y~0=~y~0_In1169402239} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1169402239, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out1169402239|, ~y$flush_delayed~0=~y$flush_delayed~0_In1169402239, ~y~0=~y~0_In1169402239} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 13:07:41,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_19 1) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_21 1) (= v_P0Thread1of1ForFork2_~arg.base_13 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_13)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_13, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~z~0=v_~z~0_19, ~x~0=v_~x~0_21, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 13:07:41,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1156743658 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1156743658 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1156743658|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1156743658 |P2Thread1of1ForFork1_#t~ite34_Out-1156743658|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1156743658, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1156743658} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1156743658, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1156743658|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1156743658} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:07:41,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1394031214| |P1Thread1of1ForFork0_#t~ite3_Out-1394031214|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1394031214 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1394031214 256)))) (or (and (= ~y~0_In-1394031214 |P1Thread1of1ForFork0_#t~ite3_Out-1394031214|) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite3_Out-1394031214| ~y$w_buff1~0_In-1394031214) .cse0 (not .cse2) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1394031214, ~y$w_buff1~0=~y$w_buff1~0_In-1394031214, ~y~0=~y~0_In-1394031214, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1394031214} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1394031214, ~y$w_buff1~0=~y$w_buff1~0_In-1394031214, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1394031214|, ~y~0=~y~0_In-1394031214, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1394031214|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1394031214} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:07:41,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1122082639 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1122082639 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1122082639|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1122082639 |P1Thread1of1ForFork0_#t~ite5_Out1122082639|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1122082639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1122082639} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1122082639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1122082639, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1122082639|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:07:41,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In1248193145 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1248193145 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1248193145 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1248193145 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite6_Out1248193145|)) (and (= ~y$w_buff1_used~0_In1248193145 |P1Thread1of1ForFork0_#t~ite6_Out1248193145|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1248193145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1248193145, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1248193145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1248193145} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1248193145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1248193145, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1248193145, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1248193145|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1248193145} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:07:41,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1018220901 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1018220901 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out1018220901|)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out1018220901| ~y$r_buff0_thd2~0_In1018220901) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1018220901, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1018220901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1018220901, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1018220901, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1018220901|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:07:41,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2120845310 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2120845310 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-2120845310 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2120845310 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite8_Out-2120845310| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite8_Out-2120845310| ~y$r_buff1_thd2~0_In-2120845310)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120845310, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120845310, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120845310, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120845310} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120845310, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120845310, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120845310, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-2120845310|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120845310} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:07:41,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_75 |v_P1Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_75, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_27|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 13:07:41,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-944554646 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-944554646 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-944554646 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-944554646 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-944554646|)) (and (= ~y$w_buff1_used~0_In-944554646 |P2Thread1of1ForFork1_#t~ite35_Out-944554646|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-944554646, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-944554646, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-944554646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-944554646} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-944554646|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-944554646, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-944554646, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-944554646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-944554646} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:07:41,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1646414113 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1646414113 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1646414113 ~y$r_buff0_thd3~0_Out-1646414113)) (and (= 0 ~y$r_buff0_thd3~0_Out-1646414113) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1646414113, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1646414113} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1646414113|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1646414113, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1646414113} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:07:41,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-68555421 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-68555421 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-68555421 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-68555421 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-68555421 |P2Thread1of1ForFork1_#t~ite37_Out-68555421|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-68555421|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-68555421, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-68555421, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-68555421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-68555421} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-68555421, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-68555421|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-68555421, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-68555421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-68555421} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:07:41,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite37_34| v_~y$r_buff1_thd3~0_143) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_143, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 13:07:41,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:07:41,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-520284445 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-520284445 256) 0))) (or (and (= ~y$w_buff1~0_In-520284445 |ULTIMATE.start_main_#t~ite41_Out-520284445|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-520284445 |ULTIMATE.start_main_#t~ite41_Out-520284445|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-520284445, ~y~0=~y~0_In-520284445, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-520284445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-520284445} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-520284445|, ~y$w_buff1~0=~y$w_buff1~0_In-520284445, ~y~0=~y~0_In-520284445, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-520284445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-520284445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 13:07:41,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L828-4-->L829: Formula: (= v_~y~0_57 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:07:41,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1794265301 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1794265301 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out1794265301|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1794265301 |ULTIMATE.start_main_#t~ite43_Out1794265301|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1794265301, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1794265301} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1794265301, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1794265301, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1794265301|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:07:41,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1208895164 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1208895164 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1208895164 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1208895164 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1208895164| ~y$w_buff1_used~0_In1208895164) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out1208895164| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1208895164, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1208895164, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1208895164, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1208895164} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1208895164, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1208895164, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1208895164, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1208895164|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1208895164} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:07:41,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1546329354 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1546329354 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1546329354|)) (and (= ~y$r_buff0_thd0~0_In-1546329354 |ULTIMATE.start_main_#t~ite45_Out-1546329354|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1546329354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1546329354} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1546329354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1546329354, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1546329354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:07:41,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In549174640 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In549174640 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In549174640 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In549174640 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out549174640| 0)) (and (= ~y$r_buff1_thd0~0_In549174640 |ULTIMATE.start_main_#t~ite46_Out549174640|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In549174640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In549174640, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In549174640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In549174640} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In549174640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In549174640, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out549174640|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In549174640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In549174640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 13:07:41,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In201571112 256) 0))) (or (and .cse0 (= ~y~0_In201571112 |ULTIMATE.start_main_#t~ite69_Out201571112|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite69_Out201571112| ~y$mem_tmp~0_In201571112)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In201571112, ~y$flush_delayed~0=~y$flush_delayed~0_In201571112, ~y~0=~y~0_In201571112} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In201571112, ~y$flush_delayed~0=~y$flush_delayed~0_In201571112, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out201571112|, ~y~0=~y~0_In201571112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-18 13:07:41,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_265 |v_ULTIMATE.start_main_#t~ite69_41|) (= v_~y$flush_delayed~0_194 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~y$flush_delayed~0=v_~y$flush_delayed~0_194, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_40|, ~y~0=v_~y~0_265, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite69, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:07:41,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:07:41 BasicIcfg [2019-12-18 13:07:41,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:07:41,628 INFO L168 Benchmark]: Toolchain (without parser) took 48977.71 ms. Allocated memory was 140.5 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 101.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 288.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:41,629 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 140.5 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:07:41,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.12 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 101.1 MB in the beginning and 156.2 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:41,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.73 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 152.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:41,633 INFO L168 Benchmark]: Boogie Preprocessor took 43.93 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:41,634 INFO L168 Benchmark]: RCFGBuilder took 1173.02 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 149.7 MB in the beginning and 205.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:41,634 INFO L168 Benchmark]: TraceAbstraction took 46853.64 ms. Allocated memory was 235.4 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 205.9 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 298.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:41,641 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.47 ms. Allocated memory is still 140.5 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.12 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 101.1 MB in the beginning and 156.2 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.73 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 152.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.93 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1173.02 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 149.7 MB in the beginning and 205.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46853.64 ms. Allocated memory was 235.4 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 205.9 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 298.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 205 ProgramPointsBefore, 120 ProgramPointsAfterwards, 257 TransitionsBefore, 143 TransitionsAfterwards, 26988 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 56 ConcurrentYvCompositions, 33 ChoiceCompositions, 9380 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 65 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 165402 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 3 y$w_buff1 = y$w_buff0 [L765] 3 y$w_buff0 = 2 [L766] 3 y$w_buff1_used = y$w_buff0_used [L767] 3 y$w_buff0_used = (_Bool)1 [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y = y$flush_delayed ? y$mem_tmp : y [L789] 3 y$flush_delayed = (_Bool)0 [L792] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 2 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L831] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L832] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 0 y$flush_delayed = weak$$choice2 [L838] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L840] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L842] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L845] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 46.5s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5064 SDtfs, 5681 SDslu, 13417 SDs, 0 SdLazy, 8104 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 96 SyntacticMatches, 49 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87886occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 20460 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1599 NumberOfCodeBlocks, 1599 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1500 ConstructedInterpolants, 0 QuantifiedInterpolants, 317902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 proved your program to be incorrect! Received shutdown request...