/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:10:04,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:10:04,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:10:04,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:10:04,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:10:04,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:10:04,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:10:04,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:10:04,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:10:04,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:10:04,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:10:04,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:10:04,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:10:04,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:10:04,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:10:04,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:10:04,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:10:04,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:10:04,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:10:04,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:10:04,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:10:04,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:10:04,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:10:04,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:10:04,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:10:04,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:10:04,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:10:04,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:10:04,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:10:04,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:10:04,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:10:04,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:10:04,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:10:04,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:10:04,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:10:04,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:10:04,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:10:04,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:10:04,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:10:04,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:10:04,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:10:04,431 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 04:10:04,445 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:10:04,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:10:04,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:10:04,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:10:04,448 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:10:04,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:10:04,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:10:04,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:10:04,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:10:04,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:10:04,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:10:04,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:10:04,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:10:04,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:10:04,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:10:04,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:10:04,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:10:04,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:10:04,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:10:04,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:10:04,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:10:04,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:10:04,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:10:04,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:10:04,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:10:04,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:10:04,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:10:04,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:10:04,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:10:04,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:10:04,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:10:04,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:10:04,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:10:04,746 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:10:04,747 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2019-12-27 04:10:04,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222a724d5/643a28948d55442387038988df34806a/FLAG8fb945165 [2019-12-27 04:10:05,394 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:10:05,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2019-12-27 04:10:05,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222a724d5/643a28948d55442387038988df34806a/FLAG8fb945165 [2019-12-27 04:10:05,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222a724d5/643a28948d55442387038988df34806a [2019-12-27 04:10:05,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:10:05,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:10:05,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:10:05,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:10:05,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:10:05,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:10:05" (1/1) ... [2019-12-27 04:10:05,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792c797e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:05, skipping insertion in model container [2019-12-27 04:10:05,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:10:05" (1/1) ... [2019-12-27 04:10:05,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:10:05,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:10:06,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:10:06,294 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:10:06,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:10:06,468 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:10:06,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06 WrapperNode [2019-12-27 04:10:06,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:10:06,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:10:06,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:10:06,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:10:06,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:10:06,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:10:06,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:10:06,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:10:06,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (1/1) ... [2019-12-27 04:10:06,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:10:06,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:10:06,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:10:06,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:10:06,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (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-27 04:10:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:10:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:10:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:10:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:10:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:10:06,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:10:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:10:06,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:10:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 04:10:06,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 04:10:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:10:06,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:10:06,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:10:06,668 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:10:07,370 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:10:07,370 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:10:07,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:10:07 BoogieIcfgContainer [2019-12-27 04:10:07,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:10:07,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:10:07,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:10:07,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:10:07,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:10:05" (1/3) ... [2019-12-27 04:10:07,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de84683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:10:07, skipping insertion in model container [2019-12-27 04:10:07,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:06" (2/3) ... [2019-12-27 04:10:07,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de84683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:10:07, skipping insertion in model container [2019-12-27 04:10:07,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:10:07" (3/3) ... [2019-12-27 04:10:07,381 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2019-12-27 04:10:07,392 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:10:07,392 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:10:07,400 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:10:07,401 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:10:07,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,442 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,442 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,453 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,453 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,465 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,467 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,467 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,474 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,474 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,477 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,477 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:07,518 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:10:07,534 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:10:07,535 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:10:07,535 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:10:07,535 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:10:07,535 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:10:07,535 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:10:07,535 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:10:07,535 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:10:07,553 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-27 04:10:07,555 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 04:10:07,659 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 04:10:07,660 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:10:07,674 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 04:10:07,690 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 04:10:07,735 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 04:10:07,735 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:10:07,741 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 04:10:07,755 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 04:10:07,756 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:10:12,605 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 04:10:12,713 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 04:10:12,734 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46210 [2019-12-27 04:10:12,734 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 04:10:12,737 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 86 transitions [2019-12-27 04:10:13,640 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15658 states. [2019-12-27 04:10:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states. [2019-12-27 04:10:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 04:10:13,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:13,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:13,650 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-27 04:10:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 430910871, now seen corresponding path program 1 times [2019-12-27 04:10:13,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:13,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566216475] [2019-12-27 04:10:13,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:13,928 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-27 04:10:13,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566216475] [2019-12-27 04:10:13,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:13,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:10:13,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828641133] [2019-12-27 04:10:13,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:13,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:13,955 INFO L87 Difference]: Start difference. First operand 15658 states. Second operand 3 states. [2019-12-27 04:10:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:14,395 INFO L93 Difference]: Finished difference Result 15586 states and 57554 transitions. [2019-12-27 04:10:14,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:14,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 04:10:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:14,602 INFO L225 Difference]: With dead ends: 15586 [2019-12-27 04:10:14,602 INFO L226 Difference]: Without dead ends: 15248 [2019-12-27 04:10:14,604 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-27 04:10:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15248 states. [2019-12-27 04:10:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15248 to 15248. [2019-12-27 04:10:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15248 states. [2019-12-27 04:10:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 56345 transitions. [2019-12-27 04:10:15,879 INFO L78 Accepts]: Start accepts. Automaton has 15248 states and 56345 transitions. Word has length 7 [2019-12-27 04:10:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:15,880 INFO L462 AbstractCegarLoop]: Abstraction has 15248 states and 56345 transitions. [2019-12-27 04:10:15,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 15248 states and 56345 transitions. [2019-12-27 04:10:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:10:15,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:15,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:15,887 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-27 04:10:15,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:15,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1550259791, now seen corresponding path program 1 times [2019-12-27 04:10:15,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:15,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715067627] [2019-12-27 04:10:15,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:15,986 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-27 04:10:15,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715067627] [2019-12-27 04:10:15,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:15,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:15,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320856872] [2019-12-27 04:10:15,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:10:15,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:15,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:10:15,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:10:15,990 INFO L87 Difference]: Start difference. First operand 15248 states and 56345 transitions. Second operand 4 states. [2019-12-27 04:10:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:16,822 INFO L93 Difference]: Finished difference Result 24364 states and 86703 transitions. [2019-12-27 04:10:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:16,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 04:10:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:16,922 INFO L225 Difference]: With dead ends: 24364 [2019-12-27 04:10:16,923 INFO L226 Difference]: Without dead ends: 24350 [2019-12-27 04:10:16,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2019-12-27 04:10:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21678. [2019-12-27 04:10:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2019-12-27 04:10:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 78082 transitions. [2019-12-27 04:10:17,852 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 78082 transitions. Word has length 13 [2019-12-27 04:10:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:17,852 INFO L462 AbstractCegarLoop]: Abstraction has 21678 states and 78082 transitions. [2019-12-27 04:10:17,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:10:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 78082 transitions. [2019-12-27 04:10:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:10:17,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:17,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:17,856 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-27 04:10:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1785022215, now seen corresponding path program 1 times [2019-12-27 04:10:17,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:17,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866189075] [2019-12-27 04:10:17,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:17,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-27 04:10:17,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866189075] [2019-12-27 04:10:17,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:17,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:17,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435598423] [2019-12-27 04:10:17,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:17,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:17,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:17,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:17,905 INFO L87 Difference]: Start difference. First operand 21678 states and 78082 transitions. Second operand 3 states. [2019-12-27 04:10:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:17,978 INFO L93 Difference]: Finished difference Result 12388 states and 38538 transitions. [2019-12-27 04:10:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:17,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 04:10:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:18,018 INFO L225 Difference]: With dead ends: 12388 [2019-12-27 04:10:18,018 INFO L226 Difference]: Without dead ends: 12388 [2019-12-27 04:10:18,019 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-27 04:10:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2019-12-27 04:10:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 12388. [2019-12-27 04:10:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-12-27 04:10:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 38538 transitions. [2019-12-27 04:10:18,369 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 38538 transitions. Word has length 13 [2019-12-27 04:10:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:18,369 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 38538 transitions. [2019-12-27 04:10:18,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 38538 transitions. [2019-12-27 04:10:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:10:18,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:18,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:18,371 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-27 04:10:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:18,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1922152669, now seen corresponding path program 1 times [2019-12-27 04:10:18,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:18,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988841628] [2019-12-27 04:10:18,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:18,428 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-27 04:10:18,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988841628] [2019-12-27 04:10:18,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:18,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:10:18,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139915222] [2019-12-27 04:10:18,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:10:18,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:10:18,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:10:18,432 INFO L87 Difference]: Start difference. First operand 12388 states and 38538 transitions. Second operand 4 states. [2019-12-27 04:10:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:18,457 INFO L93 Difference]: Finished difference Result 1903 states and 4374 transitions. [2019-12-27 04:10:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:10:18,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 04:10:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:18,466 INFO L225 Difference]: With dead ends: 1903 [2019-12-27 04:10:18,466 INFO L226 Difference]: Without dead ends: 1903 [2019-12-27 04:10:18,467 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-27 04:10:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-27 04:10:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2019-12-27 04:10:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-27 04:10:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4374 transitions. [2019-12-27 04:10:18,500 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4374 transitions. Word has length 14 [2019-12-27 04:10:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:18,500 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4374 transitions. [2019-12-27 04:10:18,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:10:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4374 transitions. [2019-12-27 04:10:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:10:18,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:18,503 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-27 04:10:18,503 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-27 04:10:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash -560054606, now seen corresponding path program 1 times [2019-12-27 04:10:18,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:18,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697638057] [2019-12-27 04:10:18,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:18,769 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 04:10:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:18,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697638057] [2019-12-27 04:10:18,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:18,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:10:18,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963221773] [2019-12-27 04:10:18,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:10:18,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:18,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:10:18,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:18,774 INFO L87 Difference]: Start difference. First operand 1903 states and 4374 transitions. Second operand 5 states. [2019-12-27 04:10:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:18,799 INFO L93 Difference]: Finished difference Result 669 states and 1571 transitions. [2019-12-27 04:10:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:18,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 04:10:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:18,801 INFO L225 Difference]: With dead ends: 669 [2019-12-27 04:10:18,802 INFO L226 Difference]: Without dead ends: 669 [2019-12-27 04:10:18,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-27 04:10:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 599. [2019-12-27 04:10:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 04:10:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1406 transitions. [2019-12-27 04:10:18,813 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1406 transitions. Word has length 26 [2019-12-27 04:10:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:18,813 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1406 transitions. [2019-12-27 04:10:18,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:10:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1406 transitions. [2019-12-27 04:10:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:10:18,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:18,817 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] [2019-12-27 04:10:18,818 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-27 04:10:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash 958609681, now seen corresponding path program 1 times [2019-12-27 04:10:18,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:18,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385367927] [2019-12-27 04:10:18,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:18,951 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-27 04:10:18,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385367927] [2019-12-27 04:10:18,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:18,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:10:18,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479420431] [2019-12-27 04:10:18,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:18,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:18,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:18,954 INFO L87 Difference]: Start difference. First operand 599 states and 1406 transitions. Second operand 3 states. [2019-12-27 04:10:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:18,994 INFO L93 Difference]: Finished difference Result 610 states and 1420 transitions. [2019-12-27 04:10:18,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:18,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 04:10:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:18,996 INFO L225 Difference]: With dead ends: 610 [2019-12-27 04:10:18,996 INFO L226 Difference]: Without dead ends: 610 [2019-12-27 04:10:18,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-27 04:10:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2019-12-27 04:10:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 04:10:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1415 transitions. [2019-12-27 04:10:19,007 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1415 transitions. Word has length 54 [2019-12-27 04:10:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:19,007 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1415 transitions. [2019-12-27 04:10:19,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1415 transitions. [2019-12-27 04:10:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:10:19,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:19,010 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] [2019-12-27 04:10:19,010 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-27 04:10:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1927722319, now seen corresponding path program 1 times [2019-12-27 04:10:19,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:19,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584622264] [2019-12-27 04:10:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:19,176 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-27 04:10:19,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584622264] [2019-12-27 04:10:19,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:19,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:10:19,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181933556] [2019-12-27 04:10:19,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:10:19,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:19,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:10:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:10:19,184 INFO L87 Difference]: Start difference. First operand 605 states and 1415 transitions. Second operand 6 states. [2019-12-27 04:10:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:19,536 INFO L93 Difference]: Finished difference Result 958 states and 2233 transitions. [2019-12-27 04:10:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:10:19,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 04:10:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:19,538 INFO L225 Difference]: With dead ends: 958 [2019-12-27 04:10:19,538 INFO L226 Difference]: Without dead ends: 958 [2019-12-27 04:10:19,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:10:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-12-27 04:10:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 763. [2019-12-27 04:10:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-12-27 04:10:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1794 transitions. [2019-12-27 04:10:19,553 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1794 transitions. Word has length 54 [2019-12-27 04:10:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:19,554 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1794 transitions. [2019-12-27 04:10:19,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:10:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1794 transitions. [2019-12-27 04:10:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:10:19,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:19,556 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] [2019-12-27 04:10:19,557 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-27 04:10:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1569420555, now seen corresponding path program 2 times [2019-12-27 04:10:19,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:19,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662764412] [2019-12-27 04:10:19,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:19,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-27 04:10:19,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662764412] [2019-12-27 04:10:19,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:19,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:10:19,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420613296] [2019-12-27 04:10:19,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:10:19,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:19,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:10:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:10:19,664 INFO L87 Difference]: Start difference. First operand 763 states and 1794 transitions. Second operand 6 states. [2019-12-27 04:10:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:20,050 INFO L93 Difference]: Finished difference Result 1306 states and 3046 transitions. [2019-12-27 04:10:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:10:20,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 04:10:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:20,053 INFO L225 Difference]: With dead ends: 1306 [2019-12-27 04:10:20,053 INFO L226 Difference]: Without dead ends: 1306 [2019-12-27 04:10:20,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:10:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-12-27 04:10:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 841. [2019-12-27 04:10:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-27 04:10:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1991 transitions. [2019-12-27 04:10:20,082 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1991 transitions. Word has length 54 [2019-12-27 04:10:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:20,082 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1991 transitions. [2019-12-27 04:10:20,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:10:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1991 transitions. [2019-12-27 04:10:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:10:20,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:20,086 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] [2019-12-27 04:10:20,086 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-27 04:10:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash 342220965, now seen corresponding path program 3 times [2019-12-27 04:10:20,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:20,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792319018] [2019-12-27 04:10:20,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:20,275 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-27 04:10:20,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792319018] [2019-12-27 04:10:20,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:20,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:10:20,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419316343] [2019-12-27 04:10:20,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:10:20,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:10:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:10:20,278 INFO L87 Difference]: Start difference. First operand 841 states and 1991 transitions. Second operand 7 states. [2019-12-27 04:10:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:20,695 INFO L93 Difference]: Finished difference Result 1322 states and 3084 transitions. [2019-12-27 04:10:20,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:10:20,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 04:10:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:20,698 INFO L225 Difference]: With dead ends: 1322 [2019-12-27 04:10:20,698 INFO L226 Difference]: Without dead ends: 1322 [2019-12-27 04:10:20,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:10:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-12-27 04:10:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 799. [2019-12-27 04:10:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-27 04:10:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1888 transitions. [2019-12-27 04:10:20,717 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1888 transitions. Word has length 54 [2019-12-27 04:10:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:20,717 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1888 transitions. [2019-12-27 04:10:20,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:10:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1888 transitions. [2019-12-27 04:10:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:10:20,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:20,720 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] [2019-12-27 04:10:20,720 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-27 04:10:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash 234191309, now seen corresponding path program 1 times [2019-12-27 04:10:20,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:20,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30261033] [2019-12-27 04:10:20,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:20,773 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-27 04:10:20,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30261033] [2019-12-27 04:10:20,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:20,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:20,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098703083] [2019-12-27 04:10:20,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:20,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:20,775 INFO L87 Difference]: Start difference. First operand 799 states and 1888 transitions. Second operand 3 states. [2019-12-27 04:10:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:20,793 INFO L93 Difference]: Finished difference Result 763 states and 1764 transitions. [2019-12-27 04:10:20,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:20,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 04:10:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:20,794 INFO L225 Difference]: With dead ends: 763 [2019-12-27 04:10:20,795 INFO L226 Difference]: Without dead ends: 763 [2019-12-27 04:10:20,795 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-27 04:10:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-12-27 04:10:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2019-12-27 04:10:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-12-27 04:10:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1764 transitions. [2019-12-27 04:10:20,807 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1764 transitions. Word has length 55 [2019-12-27 04:10:20,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:20,807 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1764 transitions. [2019-12-27 04:10:20,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1764 transitions. [2019-12-27 04:10:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:10:20,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:20,810 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] [2019-12-27 04:10:20,810 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-27 04:10:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2008175174, now seen corresponding path program 1 times [2019-12-27 04:10:20,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:20,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271164253] [2019-12-27 04:10:20,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:21,016 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-12-27 04:10:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:21,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271164253] [2019-12-27 04:10:21,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:21,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:10:21,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696986056] [2019-12-27 04:10:21,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:10:21,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:10:21,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:21,037 INFO L87 Difference]: Start difference. First operand 763 states and 1764 transitions. Second operand 5 states. [2019-12-27 04:10:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:21,074 INFO L93 Difference]: Finished difference Result 1103 states and 2377 transitions. [2019-12-27 04:10:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:21,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 04:10:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:21,077 INFO L225 Difference]: With dead ends: 1103 [2019-12-27 04:10:21,077 INFO L226 Difference]: Without dead ends: 701 [2019-12-27 04:10:21,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:10:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-27 04:10:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2019-12-27 04:10:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-12-27 04:10:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1585 transitions. [2019-12-27 04:10:21,090 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1585 transitions. Word has length 55 [2019-12-27 04:10:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:21,090 INFO L462 AbstractCegarLoop]: Abstraction has 701 states and 1585 transitions. [2019-12-27 04:10:21,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:10:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1585 transitions. [2019-12-27 04:10:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:10:21,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:21,093 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] [2019-12-27 04:10:21,093 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-27 04:10:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash 799784240, now seen corresponding path program 2 times [2019-12-27 04:10:21,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:21,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795558017] [2019-12-27 04:10:21,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:21,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795558017] [2019-12-27 04:10:21,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:21,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:21,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428203358] [2019-12-27 04:10:21,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:21,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:21,158 INFO L87 Difference]: Start difference. First operand 701 states and 1585 transitions. Second operand 3 states. [2019-12-27 04:10:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:21,205 INFO L93 Difference]: Finished difference Result 701 states and 1584 transitions. [2019-12-27 04:10:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:21,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 04:10:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:21,207 INFO L225 Difference]: With dead ends: 701 [2019-12-27 04:10:21,207 INFO L226 Difference]: Without dead ends: 701 [2019-12-27 04:10:21,207 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-27 04:10:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-27 04:10:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 436. [2019-12-27 04:10:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-27 04:10:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 970 transitions. [2019-12-27 04:10:21,216 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 970 transitions. Word has length 55 [2019-12-27 04:10:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:21,217 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 970 transitions. [2019-12-27 04:10:21,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 970 transitions. [2019-12-27 04:10:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:21,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:21,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:21,219 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-27 04:10:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash -933211760, now seen corresponding path program 1 times [2019-12-27 04:10:21,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:21,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885019872] [2019-12-27 04:10:21,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:21,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885019872] [2019-12-27 04:10:21,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:21,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:10:21,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317867367] [2019-12-27 04:10:21,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:10:21,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:10:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:10:21,362 INFO L87 Difference]: Start difference. First operand 436 states and 970 transitions. Second operand 6 states. [2019-12-27 04:10:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:21,449 INFO L93 Difference]: Finished difference Result 707 states and 1527 transitions. [2019-12-27 04:10:21,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:10:21,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 04:10:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:21,450 INFO L225 Difference]: With dead ends: 707 [2019-12-27 04:10:21,450 INFO L226 Difference]: Without dead ends: 244 [2019-12-27 04:10:21,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:10:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-27 04:10:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 220. [2019-12-27 04:10:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 04:10:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2019-12-27 04:10:21,455 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 56 [2019-12-27 04:10:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:21,455 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2019-12-27 04:10:21,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:10:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2019-12-27 04:10:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:21,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:21,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] [2019-12-27 04:10:21,457 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-27 04:10:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1590264344, now seen corresponding path program 2 times [2019-12-27 04:10:21,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:21,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953811503] [2019-12-27 04:10:21,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:21,818 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-27 04:10:21,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953811503] [2019-12-27 04:10:21,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:21,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:10:21,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51928924] [2019-12-27 04:10:21,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:10:21,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:21,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:10:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:10:21,820 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand 14 states. [2019-12-27 04:10:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:22,433 INFO L93 Difference]: Finished difference Result 392 states and 672 transitions. [2019-12-27 04:10:22,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:10:22,434 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 04:10:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:22,434 INFO L225 Difference]: With dead ends: 392 [2019-12-27 04:10:22,434 INFO L226 Difference]: Without dead ends: 362 [2019-12-27 04:10:22,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:10:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-27 04:10:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 320. [2019-12-27 04:10:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 04:10:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 558 transitions. [2019-12-27 04:10:22,441 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 558 transitions. Word has length 56 [2019-12-27 04:10:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:22,441 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 558 transitions. [2019-12-27 04:10:22,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:10:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 558 transitions. [2019-12-27 04:10:22,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:22,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:22,443 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] [2019-12-27 04:10:22,443 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-27 04:10:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1710889504, now seen corresponding path program 3 times [2019-12-27 04:10:22,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:22,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088566974] [2019-12-27 04:10:22,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:22,651 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-27 04:10:22,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088566974] [2019-12-27 04:10:22,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:22,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:10:22,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344760974] [2019-12-27 04:10:22,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:10:22,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:22,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:10:22,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:10:22,653 INFO L87 Difference]: Start difference. First operand 320 states and 558 transitions. Second operand 12 states. [2019-12-27 04:10:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:23,100 INFO L93 Difference]: Finished difference Result 420 states and 708 transitions. [2019-12-27 04:10:23,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 04:10:23,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 04:10:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:23,101 INFO L225 Difference]: With dead ends: 420 [2019-12-27 04:10:23,102 INFO L226 Difference]: Without dead ends: 390 [2019-12-27 04:10:23,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:10:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-27 04:10:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 328. [2019-12-27 04:10:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 04:10:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 572 transitions. [2019-12-27 04:10:23,111 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 572 transitions. Word has length 56 [2019-12-27 04:10:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:23,112 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 572 transitions. [2019-12-27 04:10:23,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:10:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 572 transitions. [2019-12-27 04:10:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:23,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:23,113 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] [2019-12-27 04:10:23,113 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-27 04:10:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1475134232, now seen corresponding path program 4 times [2019-12-27 04:10:23,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:23,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069009478] [2019-12-27 04:10:23,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:10:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:10:23,205 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:10:23,205 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:10:23,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_54) (= 0 v_~y$r_buff1_thd3~0_115) (= 0 v_~y$r_buff1_thd2~0_106) (= v_~weak$$choice2~0_112 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$w_buff0_used~0_737 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2504~0.base_27|) (= v_~y$w_buff1~0_230 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd3~0_169) (= 0 v_~y$w_buff0~0_338) (< 0 |v_#StackHeapBarrier_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2504~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2504~0.base_27|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2504~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2504~0.base_27|) |v_ULTIMATE.start_main_~#t2504~0.offset_20| 0)) |v_#memory_int_23|) (= v_~y$mem_tmp~0_19 0) (= v_~z~0_90 0) (= v_~x~0_77 0) (= v_~y$w_buff1_used~0_407 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2504~0.base_27| 1)) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_cnt~0_90) (= 0 |v_ULTIMATE.start_main_~#t2504~0.offset_20|) (= v_~y$r_buff1_thd0~0_237 0) (= 0 v_~y$flush_delayed~0_38) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t2504~0.base=|v_ULTIMATE.start_main_~#t2504~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_34|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_62|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_71|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_115, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_118|, ULTIMATE.start_main_~#t2504~0.offset=|v_ULTIMATE.start_main_~#t2504~0.offset_20|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_45|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_34|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_37|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_21|, ULTIMATE.start_main_~#t2505~0.offset=|v_ULTIMATE.start_main_~#t2505~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~x~0=v_~x~0_77, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_737, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_45|, ULTIMATE.start_main_~#t2506~0.offset=|v_ULTIMATE.start_main_~#t2506~0.offset_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_37|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_43|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_24|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_37|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_206|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_~#t2506~0.base=|v_ULTIMATE.start_main_~#t2506~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_114|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_42|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_112, ULTIMATE.start_main_~#t2505~0.base=|v_ULTIMATE.start_main_~#t2505~0.base_20|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2504~0.base, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2504~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t2505~0.offset, ~__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~ite29, ULTIMATE.start_main_~#t2506~0.offset, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2506~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2505~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:10:23,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L798-1-->L800: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2505~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2505~0.base_9|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2505~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t2505~0.base_9|)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2505~0.base_9| 1) |v_#valid_33|) (= |v_ULTIMATE.start_main_~#t2505~0.offset_9| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2505~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2505~0.base_9|) |v_ULTIMATE.start_main_~#t2505~0.offset_9| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t2505~0.offset=|v_ULTIMATE.start_main_~#t2505~0.offset_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2505~0.base=|v_ULTIMATE.start_main_~#t2505~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2505~0.offset, #length, ULTIMATE.start_main_~#t2505~0.base] because there is no mapped edge [2019-12-27 04:10:23,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L800-1-->L802: Formula: (and (= |v_ULTIMATE.start_main_~#t2506~0.offset_9| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2506~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2506~0.base_10|) |v_ULTIMATE.start_main_~#t2506~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2506~0.base_10| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2506~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2506~0.base_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2506~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2506~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2506~0.offset=|v_ULTIMATE.start_main_~#t2506~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t2506~0.base=|v_ULTIMATE.start_main_~#t2506~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2506~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t2506~0.base, #length] because there is no mapped edge [2019-12-27 04:10:23,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-720640649| 1) (= 0 (mod ~y$w_buff1_used~0_Out-720640649 256)) (= P2Thread1of1ForFork0_~arg.offset_Out-720640649 |P2Thread1of1ForFork0_#in~arg.offset_In-720640649|) (= ~y$w_buff0~0_Out-720640649 2) (= ~y$w_buff1_used~0_Out-720640649 ~y$w_buff0_used~0_In-720640649) (= |P2Thread1of1ForFork0_#in~arg.base_In-720640649| P2Thread1of1ForFork0_~arg.base_Out-720640649) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-720640649| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-720640649) (= ~y$w_buff0~0_In-720640649 ~y$w_buff1~0_Out-720640649) (= ~y$w_buff0_used~0_Out-720640649 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-720640649|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-720640649, ~y$w_buff0~0=~y$w_buff0~0_In-720640649, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-720640649|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-720640649, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-720640649|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-720640649|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-720640649, ~y$w_buff1~0=~y$w_buff1~0_Out-720640649, ~y$w_buff0~0=~y$w_buff0~0_Out-720640649, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-720640649, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-720640649|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-720640649, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-720640649} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:10:23,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_60 1) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~z~0_51 2) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z~0=v_~z~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_60, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 04:10:23,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1739130571 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1739130571 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out-1739130571| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1739130571 |P2Thread1of1ForFork0_#t~ite11_Out-1739130571|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739130571, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1739130571} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739130571, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1739130571|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1739130571} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 04:10:23,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In56285525 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out56285525| |P1Thread1of1ForFork2_#t~ite3_Out56285525|)) (.cse1 (= (mod ~y$w_buff1_used~0_In56285525 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out56285525| ~y~0_In56285525) .cse2) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out56285525| ~y$w_buff1~0_In56285525) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In56285525, ~y$w_buff1~0=~y$w_buff1~0_In56285525, ~y~0=~y~0_In56285525, ~y$w_buff1_used~0=~y$w_buff1_used~0_In56285525} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In56285525, ~y$w_buff1~0=~y$w_buff1~0_In56285525, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out56285525|, ~y~0=~y~0_In56285525, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out56285525|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In56285525} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 04:10:23,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-304216510 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-304216510 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-304216510 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-304216510 256)))) (or (and (= ~y$w_buff1_used~0_In-304216510 |P2Thread1of1ForFork0_#t~ite12_Out-304216510|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-304216510|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-304216510, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-304216510, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-304216510, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-304216510} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-304216510, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-304216510, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-304216510|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-304216510, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-304216510} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 04:10:23,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-38083404 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-38083404 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out-38083404| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out-38083404| ~y$w_buff0_used~0_In-38083404)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-38083404, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-38083404} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-38083404, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-38083404, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-38083404|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 04:10:23,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In77906938 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In77906938 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In77906938 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In77906938 256) 0))) (or (and (= ~y$w_buff1_used~0_In77906938 |P1Thread1of1ForFork2_#t~ite6_Out77906938|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out77906938|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In77906938, ~y$w_buff0_used~0=~y$w_buff0_used~0_In77906938, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In77906938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In77906938} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In77906938, ~y$w_buff0_used~0=~y$w_buff0_used~0_In77906938, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In77906938, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out77906938|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In77906938} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 04:10:23,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-838808461 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-838808461 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-838808461| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-838808461| ~y$r_buff0_thd2~0_In-838808461)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-838808461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-838808461} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-838808461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-838808461, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-838808461|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 04:10:23,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2111892204 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2111892204 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2111892204 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-2111892204 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-2111892204| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite8_Out-2111892204| ~y$r_buff1_thd2~0_In-2111892204)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2111892204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2111892204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2111892204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2111892204} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2111892204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2111892204, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-2111892204|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2111892204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2111892204} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 04:10:23,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_36| v_~y$r_buff1_thd2~0_71) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_71, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 04:10:23,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-806502348 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-806502348 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-806502348 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-806502348 ~y$r_buff0_thd3~0_In-806502348)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-806502348, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-806502348} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-806502348, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-806502348, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-806502348|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 04:10:23,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1290172361 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1290172361 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1290172361 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1290172361 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1290172361|)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out1290172361| ~y$r_buff1_thd3~0_In1290172361) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1290172361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1290172361, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1290172361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1290172361} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1290172361|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1290172361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1290172361, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1290172361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1290172361} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 04:10:23,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_34| v_~y$r_buff1_thd3~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_66, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 04:10:23,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 04:10:23,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In935984220 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In935984220 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite18_Out935984220| |ULTIMATE.start_main_#t~ite19_Out935984220|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out935984220| ~y$w_buff1~0_In935984220) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite18_Out935984220| ~y~0_In935984220)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In935984220, ~y~0=~y~0_In935984220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In935984220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In935984220} OutVars{~y$w_buff1~0=~y$w_buff1~0_In935984220, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out935984220|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out935984220|, ~y~0=~y~0_In935984220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In935984220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In935984220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 04:10:23,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-751620041 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-751620041 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-751620041 |ULTIMATE.start_main_#t~ite20_Out-751620041|)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-751620041|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-751620041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-751620041} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-751620041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-751620041, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-751620041|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 04:10:23,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In561272345 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In561272345 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In561272345 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In561272345 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out561272345| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out561272345| ~y$w_buff1_used~0_In561272345) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In561272345, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In561272345, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In561272345, ~y$w_buff1_used~0=~y$w_buff1_used~0_In561272345} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In561272345, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In561272345, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out561272345|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In561272345, ~y$w_buff1_used~0=~y$w_buff1_used~0_In561272345} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 04:10:23,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1319695446 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1319695446 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1319695446 |ULTIMATE.start_main_#t~ite22_Out-1319695446|)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1319695446| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1319695446, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1319695446} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1319695446, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1319695446, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1319695446|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 04:10:23,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In439831826 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In439831826 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In439831826 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In439831826 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In439831826 |ULTIMATE.start_main_#t~ite23_Out439831826|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out439831826|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In439831826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In439831826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In439831826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439831826} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In439831826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In439831826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In439831826, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out439831826|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439831826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 04:10:23,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L820-->L820-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1080893679 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1080893679 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1080893679 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In1080893679 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In1080893679 256)) .cse0))) (= ~y$w_buff0~0_In1080893679 |ULTIMATE.start_main_#t~ite29_Out1080893679|) .cse1 (= |ULTIMATE.start_main_#t~ite30_Out1080893679| |ULTIMATE.start_main_#t~ite29_Out1080893679|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite29_In1080893679| |ULTIMATE.start_main_#t~ite29_Out1080893679|) (= |ULTIMATE.start_main_#t~ite30_Out1080893679| ~y$w_buff0~0_In1080893679)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1080893679, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1080893679|, ~y$w_buff0~0=~y$w_buff0~0_In1080893679, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1080893679, ~weak$$choice2~0=~weak$$choice2~0_In1080893679, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1080893679, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1080893679} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1080893679|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1080893679, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1080893679|, ~y$w_buff0~0=~y$w_buff0~0_In1080893679, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1080893679, ~weak$$choice2~0=~weak$$choice2~0_In1080893679, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1080893679, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1080893679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 04:10:23,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L821-->L821-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In345219497 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In345219497 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In345219497 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In345219497 256)) .cse1) (= (mod ~y$w_buff0_used~0_In345219497 256) 0))) (= |ULTIMATE.start_main_#t~ite33_Out345219497| |ULTIMATE.start_main_#t~ite32_Out345219497|) (= ~y$w_buff1~0_In345219497 |ULTIMATE.start_main_#t~ite32_Out345219497|)) (and (= ~y$w_buff1~0_In345219497 |ULTIMATE.start_main_#t~ite33_Out345219497|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In345219497| |ULTIMATE.start_main_#t~ite32_Out345219497|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In345219497, ~y$w_buff0_used~0=~y$w_buff0_used~0_In345219497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In345219497, ~weak$$choice2~0=~weak$$choice2~0_In345219497, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In345219497, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In345219497|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In345219497} OutVars{~y$w_buff1~0=~y$w_buff1~0_In345219497, ~y$w_buff0_used~0=~y$w_buff0_used~0_In345219497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In345219497, ~weak$$choice2~0=~weak$$choice2~0_In345219497, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out345219497|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In345219497, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out345219497|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In345219497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 04:10:23,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In383357547 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out383357547| ~y$w_buff0_used~0_In383357547) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In383357547 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In383357547 256)) .cse1) (= (mod ~y$w_buff0_used~0_In383357547 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In383357547 256))))) (= |ULTIMATE.start_main_#t~ite36_Out383357547| |ULTIMATE.start_main_#t~ite35_Out383357547|)) (and (= |ULTIMATE.start_main_#t~ite35_In383357547| |ULTIMATE.start_main_#t~ite35_Out383357547|) (= |ULTIMATE.start_main_#t~ite36_Out383357547| ~y$w_buff0_used~0_In383357547) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In383357547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In383357547, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In383357547|, ~weak$$choice2~0=~weak$$choice2~0_In383357547, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In383357547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In383357547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In383357547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In383357547, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out383357547|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out383357547|, ~weak$$choice2~0=~weak$$choice2~0_In383357547, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In383357547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In383357547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 04:10:23,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L824-->L825-8: Formula: (and (= v_~y$r_buff1_thd0~0_226 |v_ULTIMATE.start_main_#t~ite45_60|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= |v_ULTIMATE.start_main_#t~ite43_49| |v_ULTIMATE.start_main_#t~ite43_48|) (= |v_ULTIMATE.start_main_#t~ite44_49| |v_ULTIMATE.start_main_#t~ite44_48|) (= v_~y$r_buff0_thd0~0_339 v_~y$r_buff0_thd0~0_338)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_339, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_49|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_338, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 04:10:23,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_89 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_23) (not (= (mod v_~y$flush_delayed~0_24 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 04:10:23,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L830-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 04:10:23,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:10:23 BasicIcfg [2019-12-27 04:10:23,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:10:23,327 INFO L168 Benchmark]: Toolchain (without parser) took 17682.03 ms. Allocated memory was 138.9 MB in the beginning and 744.5 MB in the end (delta: 605.6 MB). Free memory was 101.7 MB in the beginning and 175.1 MB in the end (delta: -73.4 MB). Peak memory consumption was 532.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:23,328 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 04:10:23,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.40 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 157.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:23,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.25 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:23,334 INFO L168 Benchmark]: Boogie Preprocessor took 37.64 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:23,335 INFO L168 Benchmark]: RCFGBuilder took 795.65 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 104.7 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:23,335 INFO L168 Benchmark]: TraceAbstraction took 15951.30 ms. Allocated memory was 202.9 MB in the beginning and 744.5 MB in the end (delta: 541.6 MB). Free memory was 104.7 MB in the beginning and 175.1 MB in the end (delta: -70.5 MB). Peak memory consumption was 471.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:23,341 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 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.40 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 157.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.25 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.64 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 795.65 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 104.7 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15951.30 ms. Allocated memory was 202.9 MB in the beginning and 744.5 MB in the end (delta: 541.6 MB). Free memory was 104.7 MB in the beginning and 175.1 MB in the end (delta: -70.5 MB). Peak memory consumption was 471.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 161 ProgramPointsBefore, 81 ProgramPointsAfterwards, 192 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 4050 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 227 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46210 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L800] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L802] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=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=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] [L775] 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 [__unbuffered_cnt=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=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] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2] [L775] 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) [L746] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 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) [L777] 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 [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 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 [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2] [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 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 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=2] [L819] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=2] [L819] 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) [L820] 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)) [L821] 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)) [L822] 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)) [L823] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=2] [L823] 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)) [L825] 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)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1439 SDtfs, 1298 SDslu, 3389 SDs, 0 SdLazy, 1922 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21678occurred 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: 2.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 4323 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 103636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...