/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/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:34:09,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:34:09,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:34:09,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:34:09,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:34:09,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:34:09,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:34:09,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:34:09,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:34:09,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:34:09,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:34:09,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:34:09,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:34:09,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:34:09,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:34:09,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:34:09,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:34:09,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:34:09,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:34:09,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:34:09,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:34:09,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:34:09,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:34:09,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:34:09,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:34:09,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:34:09,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:34:09,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:34:09,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:34:09,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:34:09,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:34:09,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:34:09,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:34:09,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:34:09,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:34:09,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:34:09,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:34:09,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:34:09,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:34:09,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:34:09,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:34:09,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:34:09,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:34:09,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:34:09,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:34:09,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:34:09,499 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:34:09,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:34:09,500 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:34:09,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:34:09,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:34:09,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:34:09,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:34:09,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:34:09,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:34:09,501 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:34:09,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:34:09,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:34:09,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:34:09,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:34:09,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:34:09,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:34:09,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:34:09,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:34:09,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:34:09,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:34:09,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:34:09,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:34:09,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:34:09,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:34:09,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:34:09,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:34:09,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:34:09,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:34:09,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:34:09,794 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:34:09,794 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2019-12-18 17:34:09,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1178d7f4/20a9f7029a6b44ef83b2e40de061b578/FLAG1afa5c927 [2019-12-18 17:34:10,462 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:34:10,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2019-12-18 17:34:10,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1178d7f4/20a9f7029a6b44ef83b2e40de061b578/FLAG1afa5c927 [2019-12-18 17:34:10,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1178d7f4/20a9f7029a6b44ef83b2e40de061b578 [2019-12-18 17:34:10,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:34:10,736 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:34:10,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:34:10,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:34:10,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:34:10,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:34:10" (1/1) ... [2019-12-18 17:34:10,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afd1b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:10, skipping insertion in model container [2019-12-18 17:34:10,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:34:10" (1/1) ... [2019-12-18 17:34:10,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:34:10,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:34:11,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:34:11,339 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:34:11,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:34:11,512 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:34:11,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11 WrapperNode [2019-12-18 17:34:11,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:34:11,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:34:11,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:34:11,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:34:11,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:34:11,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:34:11,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:34:11,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:34:11,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... [2019-12-18 17:34:11,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:34:11,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:34:11,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:34:11,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:34:11,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:34:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:34:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:34:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:34:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:34:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:34:11,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:34:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:34:11,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:34:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:34:11,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:34:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:34:11,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:34:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:34:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:34:11,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:34:11,695 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:34:12,392 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:34:12,392 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:34:12,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:34:12 BoogieIcfgContainer [2019-12-18 17:34:12,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:34:12,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:34:12,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:34:12,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:34:12,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:34:10" (1/3) ... [2019-12-18 17:34:12,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d11fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:34:12, skipping insertion in model container [2019-12-18 17:34:12,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:34:11" (2/3) ... [2019-12-18 17:34:12,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d11fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:34:12, skipping insertion in model container [2019-12-18 17:34:12,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:34:12" (3/3) ... [2019-12-18 17:34:12,402 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2019-12-18 17:34:12,412 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:34:12,412 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:34:12,420 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:34:12,421 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:34:12,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,461 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,461 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,471 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,471 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,471 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,472 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,472 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,494 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,508 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,508 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,511 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,511 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,513 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:34:12,527 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:34:12,547 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:34:12,547 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:34:12,547 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:34:12,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:34:12,548 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:34:12,548 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:34:12,548 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:34:12,548 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:34:12,564 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 17:34:12,567 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 17:34:12,662 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 17:34:12,662 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:34:12,679 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:34:12,704 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 17:34:12,781 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 17:34:12,781 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:34:12,790 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:34:12,808 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:34:12,809 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:34:17,909 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 17:34:18,044 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 17:34:18,067 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-18 17:34:18,068 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 17:34:18,071 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 17:34:20,904 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-18 17:34:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-18 17:34:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:34:20,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:20,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:20,915 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-18 17:34:20,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:20,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893597738] [2019-12-18 17:34:20,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:21,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893597738] [2019-12-18 17:34:21,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:21,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:34:21,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114272793] [2019-12-18 17:34:21,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:21,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:21,254 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-18 17:34:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:22,195 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-18 17:34:22,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:22,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:34:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:22,568 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 17:34:22,568 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 17:34:22,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 17:34:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 17:34:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 17:34:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-18 17:34:26,250 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-18 17:34:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:26,251 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-18 17:34:26,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-18 17:34:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:34:26,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:26,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:26,259 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:26,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:26,259 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-18 17:34:26,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:26,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321403137] [2019-12-18 17:34:26,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:26,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321403137] [2019-12-18 17:34:26,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:26,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:34:26,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124294458] [2019-12-18 17:34:26,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:34:26,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:34:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:34:26,357 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-18 17:34:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:27,229 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-18 17:34:27,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:34:27,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:34:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:28,028 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 17:34:28,029 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 17:34:28,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:34:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 17:34:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-18 17:34:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-18 17:34:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-18 17:34:32,038 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-18 17:34:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:32,039 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-18 17:34:32,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:34:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-18 17:34:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:34:32,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:32,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:32,042 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-18 17:34:32,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:32,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908606064] [2019-12-18 17:34:32,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:32,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908606064] [2019-12-18 17:34:32,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:32,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:34:32,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734935322] [2019-12-18 17:34:32,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:32,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:32,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:32,096 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-18 17:34:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:32,301 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-18 17:34:32,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:32,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:34:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:32,440 INFO L225 Difference]: With dead ends: 40168 [2019-12-18 17:34:32,441 INFO L226 Difference]: Without dead ends: 40168 [2019-12-18 17:34:32,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-18 17:34:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-18 17:34:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-18 17:34:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-18 17:34:33,979 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-18 17:34:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:33,980 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-18 17:34:33,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-18 17:34:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:34:33,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:33,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:33,983 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-18 17:34:33,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:33,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132152035] [2019-12-18 17:34:33,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:34,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132152035] [2019-12-18 17:34:34,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:34,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:34:34,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445765449] [2019-12-18 17:34:34,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:34:34,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:34,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:34:34,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:34:34,034 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-18 17:34:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:34,118 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-18 17:34:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:34:34,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:34:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:34,153 INFO L225 Difference]: With dead ends: 16680 [2019-12-18 17:34:34,153 INFO L226 Difference]: Without dead ends: 16680 [2019-12-18 17:34:34,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:34:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-18 17:34:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-18 17:34:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-18 17:34:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-18 17:34:35,948 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-18 17:34:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:35,949 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-18 17:34:35,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:34:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-18 17:34:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 17:34:35,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:35,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:35,953 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-18 17:34:35,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:35,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141377926] [2019-12-18 17:34:35,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:36,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141377926] [2019-12-18 17:34:36,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:36,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:34:36,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903153692] [2019-12-18 17:34:36,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:34:36,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:34:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:34:36,004 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-18 17:34:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:36,041 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-18 17:34:36,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:34:36,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 17:34:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:36,046 INFO L225 Difference]: With dead ends: 2823 [2019-12-18 17:34:36,047 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 17:34:36,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:34:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 17:34:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-18 17:34:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-18 17:34:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-18 17:34:36,089 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-18 17:34:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:36,089 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-18 17:34:36,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:34:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-18 17:34:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:34:36,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:36,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:36,094 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:36,094 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-18 17:34:36,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:36,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654871590] [2019-12-18 17:34:36,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:36,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654871590] [2019-12-18 17:34:36,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:36,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:34:36,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954195287] [2019-12-18 17:34:36,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:34:36,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:36,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:34:36,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:36,196 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-18 17:34:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:36,246 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-18 17:34:36,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:34:36,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:34:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:36,249 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 17:34:36,250 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 17:34:36,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 17:34:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 17:34:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 17:34:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-18 17:34:36,269 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-18 17:34:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:36,269 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-18 17:34:36,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:34:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-18 17:34:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:34:36,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:36,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:36,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-18 17:34:36,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:36,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861180199] [2019-12-18 17:34:36,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:36,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861180199] [2019-12-18 17:34:36,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:36,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:34:36,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215804185] [2019-12-18 17:34:36,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:36,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:36,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:36,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:36,399 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-18 17:34:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:36,453 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-18 17:34:36,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:36,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:34:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:36,456 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 17:34:36,456 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 17:34:36,457 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-18 17:34:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 17:34:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 17:34:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 17:34:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-18 17:34:36,476 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-18 17:34:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:36,476 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-18 17:34:36,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-18 17:34:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:34:36,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:36,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:36,481 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-18 17:34:36,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:36,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523465927] [2019-12-18 17:34:36,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:36,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523465927] [2019-12-18 17:34:36,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:36,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:34:36,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269018883] [2019-12-18 17:34:36,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:36,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:36,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:36,555 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-18 17:34:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:36,608 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-18 17:34:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:36,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:34:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:36,611 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 17:34:36,611 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 17:34:36,612 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-18 17:34:36,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 17:34:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-18 17:34:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-18 17:34:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-18 17:34:36,631 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-18 17:34:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:36,632 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-18 17:34:36,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-18 17:34:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:34:36,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:36,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:36,636 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-18 17:34:36,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:36,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618496965] [2019-12-18 17:34:36,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:36,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618496965] [2019-12-18 17:34:36,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:36,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:34:36,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036757251] [2019-12-18 17:34:36,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:34:36,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:34:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:34:36,740 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-18 17:34:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:36,964 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-18 17:34:36,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:34:36,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 17:34:36,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:36,967 INFO L225 Difference]: With dead ends: 1764 [2019-12-18 17:34:36,968 INFO L226 Difference]: Without dead ends: 1764 [2019-12-18 17:34:36,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:36,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-18 17:34:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-18 17:34:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-18 17:34:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-18 17:34:36,992 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-18 17:34:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:36,992 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-18 17:34:36,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:34:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-18 17:34:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:34:36,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:36,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:36,997 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:36,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:36,998 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-18 17:34:36,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:36,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820699559] [2019-12-18 17:34:36,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:37,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820699559] [2019-12-18 17:34:37,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:37,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:34:37,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309474840] [2019-12-18 17:34:37,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:34:37,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:34:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:37,203 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-18 17:34:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:37,510 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-18 17:34:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:34:37,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:34:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:37,515 INFO L225 Difference]: With dead ends: 2370 [2019-12-18 17:34:37,515 INFO L226 Difference]: Without dead ends: 2370 [2019-12-18 17:34:37,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:34:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-18 17:34:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-18 17:34:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-18 17:34:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-18 17:34:37,545 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-18 17:34:37,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:37,546 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-18 17:34:37,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:34:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-18 17:34:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:34:37,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:37,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:37,550 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-18 17:34:37,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:37,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743283740] [2019-12-18 17:34:37,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:37,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743283740] [2019-12-18 17:34:37,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:37,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:34:37,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564563468] [2019-12-18 17:34:37,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:34:37,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:37,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:34:37,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:37,664 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 6 states. [2019-12-18 17:34:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:38,037 INFO L93 Difference]: Finished difference Result 2377 states and 6752 transitions. [2019-12-18 17:34:38,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:34:38,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:34:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:38,041 INFO L225 Difference]: With dead ends: 2377 [2019-12-18 17:34:38,041 INFO L226 Difference]: Without dead ends: 2377 [2019-12-18 17:34:38,042 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-18 17:34:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-18 17:34:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1691. [2019-12-18 17:34:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-18 17:34:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4860 transitions. [2019-12-18 17:34:38,062 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4860 transitions. Word has length 58 [2019-12-18 17:34:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:38,062 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4860 transitions. [2019-12-18 17:34:38,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:34:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4860 transitions. [2019-12-18 17:34:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:34:38,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:38,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:38,068 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash -687244225, now seen corresponding path program 4 times [2019-12-18 17:34:38,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:38,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293778790] [2019-12-18 17:34:38,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:38,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293778790] [2019-12-18 17:34:38,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:38,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:34:38,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871562532] [2019-12-18 17:34:38,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:34:38,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:34:38,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:34:38,249 INFO L87 Difference]: Start difference. First operand 1691 states and 4860 transitions. Second operand 9 states. [2019-12-18 17:34:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:38,726 INFO L93 Difference]: Finished difference Result 3390 states and 9119 transitions. [2019-12-18 17:34:38,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:34:38,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-18 17:34:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:38,732 INFO L225 Difference]: With dead ends: 3390 [2019-12-18 17:34:38,732 INFO L226 Difference]: Without dead ends: 2437 [2019-12-18 17:34:38,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:34:38,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-12-18 17:34:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1545. [2019-12-18 17:34:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-12-18 17:34:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 4366 transitions. [2019-12-18 17:34:38,757 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 4366 transitions. Word has length 58 [2019-12-18 17:34:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:38,757 INFO L462 AbstractCegarLoop]: Abstraction has 1545 states and 4366 transitions. [2019-12-18 17:34:38,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:34:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 4366 transitions. [2019-12-18 17:34:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:34:38,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:38,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:38,761 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:38,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:38,762 INFO L82 PathProgramCache]: Analyzing trace with hash 723375403, now seen corresponding path program 5 times [2019-12-18 17:34:38,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:38,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102363074] [2019-12-18 17:34:38,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:38,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102363074] [2019-12-18 17:34:38,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:38,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:34:38,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297224419] [2019-12-18 17:34:38,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:34:38,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:34:38,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:34:38,864 INFO L87 Difference]: Start difference. First operand 1545 states and 4366 transitions. Second operand 7 states. [2019-12-18 17:34:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:39,327 INFO L93 Difference]: Finished difference Result 2474 states and 6942 transitions. [2019-12-18 17:34:39,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:34:39,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 17:34:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:39,333 INFO L225 Difference]: With dead ends: 2474 [2019-12-18 17:34:39,333 INFO L226 Difference]: Without dead ends: 2474 [2019-12-18 17:34:39,333 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-18 17:34:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-12-18 17:34:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 1477. [2019-12-18 17:34:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-12-18 17:34:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 4172 transitions. [2019-12-18 17:34:39,358 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 4172 transitions. Word has length 58 [2019-12-18 17:34:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:39,358 INFO L462 AbstractCegarLoop]: Abstraction has 1477 states and 4172 transitions. [2019-12-18 17:34:39,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:34:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 4172 transitions. [2019-12-18 17:34:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:34:39,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:39,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:39,363 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:39,363 INFO L82 PathProgramCache]: Analyzing trace with hash 726022051, now seen corresponding path program 1 times [2019-12-18 17:34:39,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:39,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353470680] [2019-12-18 17:34:39,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:39,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353470680] [2019-12-18 17:34:39,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:39,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:34:39,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242333519] [2019-12-18 17:34:39,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:34:39,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:39,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:34:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:34:39,519 INFO L87 Difference]: Start difference. First operand 1477 states and 4172 transitions. Second operand 7 states. [2019-12-18 17:34:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:39,683 INFO L93 Difference]: Finished difference Result 2687 states and 7057 transitions. [2019-12-18 17:34:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:34:39,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 17:34:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:39,687 INFO L225 Difference]: With dead ends: 2687 [2019-12-18 17:34:39,687 INFO L226 Difference]: Without dead ends: 1558 [2019-12-18 17:34:39,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:34:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-12-18 17:34:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1089. [2019-12-18 17:34:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-12-18 17:34:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 2712 transitions. [2019-12-18 17:34:39,704 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 2712 transitions. Word has length 59 [2019-12-18 17:34:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:39,705 INFO L462 AbstractCegarLoop]: Abstraction has 1089 states and 2712 transitions. [2019-12-18 17:34:39,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:34:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 2712 transitions. [2019-12-18 17:34:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:34:39,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:39,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:39,707 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash -730467221, now seen corresponding path program 2 times [2019-12-18 17:34:39,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:39,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122645836] [2019-12-18 17:34:39,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:39,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122645836] [2019-12-18 17:34:39,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:39,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:34:39,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762573806] [2019-12-18 17:34:39,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:39,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:39,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:39,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:39,803 INFO L87 Difference]: Start difference. First operand 1089 states and 2712 transitions. Second operand 3 states. [2019-12-18 17:34:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:39,854 INFO L93 Difference]: Finished difference Result 1088 states and 2710 transitions. [2019-12-18 17:34:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:39,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:34:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:39,856 INFO L225 Difference]: With dead ends: 1088 [2019-12-18 17:34:39,856 INFO L226 Difference]: Without dead ends: 1088 [2019-12-18 17:34:39,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-12-18 17:34:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 694. [2019-12-18 17:34:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-18 17:34:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1729 transitions. [2019-12-18 17:34:39,873 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1729 transitions. Word has length 59 [2019-12-18 17:34:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:39,873 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1729 transitions. [2019-12-18 17:34:39,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1729 transitions. [2019-12-18 17:34:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:34:39,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:39,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:39,875 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 83225480, now seen corresponding path program 1 times [2019-12-18 17:34:39,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:39,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536612130] [2019-12-18 17:34:39,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:40,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536612130] [2019-12-18 17:34:40,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:40,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:34:40,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522070964] [2019-12-18 17:34:40,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:34:40,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:40,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:34:40,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:40,048 INFO L87 Difference]: Start difference. First operand 694 states and 1729 transitions. Second operand 6 states. [2019-12-18 17:34:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:40,235 INFO L93 Difference]: Finished difference Result 1065 states and 2579 transitions. [2019-12-18 17:34:40,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:34:40,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 17:34:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:40,236 INFO L225 Difference]: With dead ends: 1065 [2019-12-18 17:34:40,236 INFO L226 Difference]: Without dead ends: 330 [2019-12-18 17:34:40,237 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-18 17:34:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-12-18 17:34:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 290. [2019-12-18 17:34:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-18 17:34:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 531 transitions. [2019-12-18 17:34:40,242 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 531 transitions. Word has length 59 [2019-12-18 17:34:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:40,242 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 531 transitions. [2019-12-18 17:34:40,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:34:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 531 transitions. [2019-12-18 17:34:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:34:40,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:40,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:40,244 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:40,245 INFO L82 PathProgramCache]: Analyzing trace with hash 211375676, now seen corresponding path program 2 times [2019-12-18 17:34:40,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:40,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174114581] [2019-12-18 17:34:40,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:40,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174114581] [2019-12-18 17:34:40,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:40,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:34:40,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72634011] [2019-12-18 17:34:40,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:40,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:40,307 INFO L87 Difference]: Start difference. First operand 290 states and 531 transitions. Second operand 3 states. [2019-12-18 17:34:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:40,318 INFO L93 Difference]: Finished difference Result 269 states and 474 transitions. [2019-12-18 17:34:40,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:40,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:34:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:40,319 INFO L225 Difference]: With dead ends: 269 [2019-12-18 17:34:40,319 INFO L226 Difference]: Without dead ends: 269 [2019-12-18 17:34:40,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-18 17:34:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2019-12-18 17:34:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 17:34:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-18 17:34:40,325 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 59 [2019-12-18 17:34:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:40,325 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-18 17:34:40,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-18 17:34:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:34:40,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:40,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:40,327 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 1 times [2019-12-18 17:34:40,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:40,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136158464] [2019-12-18 17:34:40,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:40,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136158464] [2019-12-18 17:34:40,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:40,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:34:40,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645453476] [2019-12-18 17:34:40,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:34:40,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:40,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:34:40,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:34:40,641 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 14 states. [2019-12-18 17:34:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:41,155 INFO L93 Difference]: Finished difference Result 403 states and 684 transitions. [2019-12-18 17:34:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:34:41,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 17:34:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:41,156 INFO L225 Difference]: With dead ends: 403 [2019-12-18 17:34:41,156 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 17:34:41,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-18 17:34:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 17:34:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 337. [2019-12-18 17:34:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-18 17:34:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 585 transitions. [2019-12-18 17:34:41,162 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 585 transitions. Word has length 60 [2019-12-18 17:34:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:41,163 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 585 transitions. [2019-12-18 17:34:41,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:34:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 585 transitions. [2019-12-18 17:34:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:34:41,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:41,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:41,164 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1191078724, now seen corresponding path program 2 times [2019-12-18 17:34:41,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:41,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436626754] [2019-12-18 17:34:41,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:34:41,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436626754] [2019-12-18 17:34:41,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:41,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:34:41,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007054562] [2019-12-18 17:34:41,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:34:41,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:41,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:34:41,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:34:41,414 INFO L87 Difference]: Start difference. First operand 337 states and 585 transitions. Second operand 12 states. [2019-12-18 17:34:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:41,831 INFO L93 Difference]: Finished difference Result 439 states and 735 transitions. [2019-12-18 17:34:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:34:41,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 17:34:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:41,833 INFO L225 Difference]: With dead ends: 439 [2019-12-18 17:34:41,833 INFO L226 Difference]: Without dead ends: 407 [2019-12-18 17:34:41,833 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-18 17:34:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-18 17:34:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 345. [2019-12-18 17:34:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 17:34:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-18 17:34:41,838 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-18 17:34:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:41,838 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-18 17:34:41,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:34:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-18 17:34:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:34:41,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:41,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:41,840 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 3 times [2019-12-18 17:34:41,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:41,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317741452] [2019-12-18 17:34:41,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:34:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:34:41,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:34:41,946 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:34:41,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_33) (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~x~0_30 0) (= |v_ULTIMATE.start_main_~#t1221~0.offset_16| 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1221~0.base_19| 4)) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1221~0.base_19| 1) |v_#valid_70|) (= v_~b~0_102 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1221~0.base_19|) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~y~0_50 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1221~0.base_19|) 0) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1221~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1221~0.base_19|) |v_ULTIMATE.start_main_~#t1221~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$r_buff0_thd1~0_87 0) (= v_~z$w_buff1_used~0_620 0) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ULTIMATE.start_main_~#t1223~0.offset=|v_ULTIMATE.start_main_~#t1223~0.offset_16|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ULTIMATE.start_main_~#t1222~0.base=|v_ULTIMATE.start_main_~#t1222~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_~#t1223~0.base=|v_ULTIMATE.start_main_~#t1223~0.base_21|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ULTIMATE.start_main_~#t1224~0.offset=|v_ULTIMATE.start_main_~#t1224~0.offset_17|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t1224~0.base=|v_ULTIMATE.start_main_~#t1224~0.base_22|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_~#t1222~0.offset=|v_ULTIMATE.start_main_~#t1222~0.offset_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_~#t1221~0.base=|v_ULTIMATE.start_main_~#t1221~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, ULTIMATE.start_main_~#t1221~0.offset=|v_ULTIMATE.start_main_~#t1221~0.offset_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1223~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1222~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1223~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1224~0.offset, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1224~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1222~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1221~0.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1221~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:34:41,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1222~0.base_13| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t1222~0.offset_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1222~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1222~0.base_13|) |v_ULTIMATE.start_main_~#t1222~0.offset_11| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1222~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1222~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1222~0.base_13| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1222~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1222~0.offset=|v_ULTIMATE.start_main_~#t1222~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1222~0.base=|v_ULTIMATE.start_main_~#t1222~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1222~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1222~0.base] because there is no mapped edge [2019-12-18 17:34:41,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1223~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1223~0.base_12| 0)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1223~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1223~0.offset_10|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1223~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1223~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1223~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1223~0.base_12|) |v_ULTIMATE.start_main_~#t1223~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1223~0.base=|v_ULTIMATE.start_main_~#t1223~0.base_12|, ULTIMATE.start_main_~#t1223~0.offset=|v_ULTIMATE.start_main_~#t1223~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1223~0.base, ULTIMATE.start_main_~#t1223~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:34:41,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1224~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1224~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1224~0.base_12|) |v_ULTIMATE.start_main_~#t1224~0.offset_10| 3)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1224~0.base_12| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1224~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1224~0.base_12|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1224~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1224~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1224~0.offset=|v_ULTIMATE.start_main_~#t1224~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1224~0.base=|v_ULTIMATE.start_main_~#t1224~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1224~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1224~0.base] because there is no mapped edge [2019-12-18 17:34:41,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:34:41,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~x~0_21 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_21, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:34:41,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_35 1) (= v_~x~0_26 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_35, ~x~0=v_~x~0_26, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:34:41,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1059931821 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1059931821 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-1059931821|)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-1059931821| ~z$w_buff0_used~0_In-1059931821)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1059931821, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1059931821} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1059931821, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1059931821, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1059931821|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:34:41,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1996271663 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1996271663 256)))) (or (and (= ~z$w_buff1~0_In1996271663 |P2Thread1of1ForFork2_#t~ite3_Out1996271663|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In1996271663 |P2Thread1of1ForFork2_#t~ite3_Out1996271663|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1996271663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1996271663, ~z$w_buff1~0=~z$w_buff1~0_In1996271663, ~z~0=~z~0_In1996271663} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1996271663|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1996271663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1996271663, ~z$w_buff1~0=~z$w_buff1~0_In1996271663, ~z~0=~z~0_In1996271663} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:34:41,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In215903978 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In215903978 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In215903978 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In215903978 256) 0))) (or (and (= ~z$w_buff1_used~0_In215903978 |P3Thread1of1ForFork3_#t~ite12_Out215903978|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out215903978|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In215903978, ~z$w_buff0_used~0=~z$w_buff0_used~0_In215903978, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In215903978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215903978} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In215903978, ~z$w_buff0_used~0=~z$w_buff0_used~0_In215903978, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In215903978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215903978, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out215903978|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:34:41,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-2143672708 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2143672708 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-2143672708)) (and (= ~z$r_buff0_thd4~0_In-2143672708 ~z$r_buff0_thd4~0_Out-2143672708) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2143672708, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2143672708} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2143672708, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-2143672708, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-2143672708|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:34:41,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-496429115 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-496429115 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-496429115 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-496429115 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-496429115| ~z$r_buff1_thd4~0_In-496429115) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork3_#t~ite14_Out-496429115| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-496429115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-496429115, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-496429115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-496429115} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-496429115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-496429115, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-496429115|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-496429115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-496429115} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:34:41,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:34:41,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:34:41,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2002682835 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In2002682835 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out2002682835|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In2002682835 |P2Thread1of1ForFork2_#t~ite5_Out2002682835|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2002682835, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2002682835} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out2002682835|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2002682835, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2002682835} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:34:41,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1876774722 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1876774722 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1876774722 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1876774722 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1876774722|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1876774722 |P2Thread1of1ForFork2_#t~ite6_Out-1876774722|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1876774722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1876774722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1876774722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1876774722} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1876774722|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1876774722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1876774722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1876774722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1876774722} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:34:41,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1813030216 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1813030216 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1813030216| ~z$r_buff0_thd3~0_In1813030216) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1813030216|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1813030216, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1813030216} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1813030216, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1813030216, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1813030216|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:34:41,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-908876080 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-908876080 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-908876080 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-908876080 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out-908876080| 0)) (and (= ~z$r_buff1_thd3~0_In-908876080 |P2Thread1of1ForFork2_#t~ite8_Out-908876080|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-908876080, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-908876080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908876080, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-908876080} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-908876080, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-908876080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908876080, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-908876080, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-908876080|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:34:41,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:34:41,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 17:34:41,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1350027031 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1350027031 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1350027031| ~z$w_buff1~0_In-1350027031) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1350027031| ~z~0_In-1350027031)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1350027031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1350027031, ~z$w_buff1~0=~z$w_buff1~0_In-1350027031, ~z~0=~z~0_In-1350027031} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1350027031|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1350027031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1350027031, ~z$w_buff1~0=~z$w_buff1~0_In-1350027031, ~z~0=~z~0_In-1350027031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:34:41,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:34:41,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1020398932 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1020398932 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1020398932| ~z$w_buff0_used~0_In-1020398932) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1020398932| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1020398932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1020398932} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1020398932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1020398932, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1020398932|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:34:41,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-168462036 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-168462036 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-168462036 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-168462036 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-168462036 |ULTIMATE.start_main_#t~ite22_Out-168462036|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-168462036|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-168462036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-168462036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-168462036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-168462036} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-168462036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-168462036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-168462036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-168462036, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-168462036|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:34:41,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In343365235 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In343365235 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out343365235| ~z$r_buff0_thd0~0_In343365235) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out343365235|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In343365235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In343365235} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In343365235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In343365235, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out343365235|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:34:41,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1059169266 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1059169266 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1059169266 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1059169266 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1059169266 |ULTIMATE.start_main_#t~ite24_Out1059169266|)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out1059169266|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1059169266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1059169266, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1059169266, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1059169266} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1059169266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1059169266, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1059169266, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1059169266|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1059169266} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:34:41,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In51314998 256)))) (or (and (= ~z$w_buff1_used~0_In51314998 |ULTIMATE.start_main_#t~ite40_Out51314998|) (= |ULTIMATE.start_main_#t~ite39_In51314998| |ULTIMATE.start_main_#t~ite39_Out51314998|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite39_Out51314998| |ULTIMATE.start_main_#t~ite40_Out51314998|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In51314998 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In51314998 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In51314998 256) 0)) (and (= (mod ~z$r_buff1_thd0~0_In51314998 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out51314998| ~z$w_buff1_used~0_In51314998) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In51314998, ~z$w_buff0_used~0=~z$w_buff0_used~0_In51314998, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In51314998|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In51314998, ~z$w_buff1_used~0=~z$w_buff1_used~0_In51314998, ~weak$$choice2~0=~weak$$choice2~0_In51314998} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In51314998, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out51314998|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out51314998|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In51314998, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In51314998, ~z$w_buff1_used~0=~z$w_buff1_used~0_In51314998, ~weak$$choice2~0=~weak$$choice2~0_In51314998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:34:41,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:34:41,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1548611790 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite46_Out-1548611790| |ULTIMATE.start_main_#t~ite45_Out-1548611790|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1548611790 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-1548611790 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1548611790 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1548611790 256)) .cse1))) (= ~z$r_buff1_thd0~0_In-1548611790 |ULTIMATE.start_main_#t~ite45_Out-1548611790|)) (and (= |ULTIMATE.start_main_#t~ite45_In-1548611790| |ULTIMATE.start_main_#t~ite45_Out-1548611790|) (= ~z$r_buff1_thd0~0_In-1548611790 |ULTIMATE.start_main_#t~ite46_Out-1548611790|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1548611790, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1548611790, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1548611790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1548611790, ~weak$$choice2~0=~weak$$choice2~0_In-1548611790, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1548611790|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1548611790, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1548611790, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1548611790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1548611790, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1548611790|, ~weak$$choice2~0=~weak$$choice2~0_In-1548611790, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1548611790|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:34:41,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:34:41,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 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_8, 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-18 17:34:42,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:34:42 BasicIcfg [2019-12-18 17:34:42,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:34:42,084 INFO L168 Benchmark]: Toolchain (without parser) took 31348.57 ms. Allocated memory was 146.3 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 103.0 MB in the beginning and 755.7 MB in the end (delta: -652.6 MB). Peak memory consumption was 619.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:42,085 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:34:42,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.59 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 158.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:42,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.53 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:42,087 INFO L168 Benchmark]: Boogie Preprocessor took 44.53 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:42,088 INFO L168 Benchmark]: RCFGBuilder took 758.87 ms. Allocated memory is still 204.5 MB. Free memory was 153.3 MB in the beginning and 104.2 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:42,088 INFO L168 Benchmark]: TraceAbstraction took 29687.14 ms. Allocated memory was 204.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.5 MB in the beginning and 755.7 MB in the end (delta: -652.2 MB). Peak memory consumption was 562.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:42,094 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.59 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 158.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.53 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.53 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.87 ms. Allocated memory is still 204.5 MB. Free memory was 153.3 MB in the beginning and 104.2 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29687.14 ms. Allocated memory was 204.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.5 MB in the beginning and 755.7 MB in the end (delta: -652.2 MB). Peak memory consumption was 562.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2128 SDtfs, 2284 SDslu, 5118 SDs, 0 SdLazy, 2419 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 41 SyntacticMatches, 14 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred 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: 11.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 9853 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 923 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 844 ConstructedInterpolants, 0 QuantifiedInterpolants, 174516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...