/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/mix047_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:36:14,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:36:14,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:36:14,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:36:14,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:36:14,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:36:14,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:36:14,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:36:14,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:36:14,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:36:14,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:36:14,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:36:14,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:36:14,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:36:14,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:36:14,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:36:14,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:36:14,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:36:14,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:36:14,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:36:14,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:36:14,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:36:14,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:36:14,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:36:14,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:36:14,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:36:14,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:36:14,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:36:14,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:36:14,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:36:14,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:36:14,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:36:14,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:36:14,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:36:14,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:36:14,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:36:14,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:36:14,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:36:14,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:36:14,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:36:14,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:36:14,484 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:36:14,498 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:36:14,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:36:14,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:36:14,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:36:14,500 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:36:14,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:36:14,501 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:36:14,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:36:14,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:36:14,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:36:14,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:36:14,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:36:14,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:36:14,502 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:36:14,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:36:14,503 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:36:14,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:36:14,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:36:14,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:36:14,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:36:14,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:36:14,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:36:14,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:36:14,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:36:14,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:36:14,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:36:14,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:36:14,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:36:14,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:36:14,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:36:14,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:36:14,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:36:14,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:36:14,779 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:36:14,780 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2019-12-18 17:36:14,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4783ccdf6/494902d7eeb14e689987061253bea930/FLAGa3bb39943 [2019-12-18 17:36:15,414 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:36:15,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2019-12-18 17:36:15,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4783ccdf6/494902d7eeb14e689987061253bea930/FLAGa3bb39943 [2019-12-18 17:36:15,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4783ccdf6/494902d7eeb14e689987061253bea930 [2019-12-18 17:36:15,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:36:15,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:36:15,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:36:15,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:36:15,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:36:15,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:36:15" (1/1) ... [2019-12-18 17:36:15,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123cbba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:15, skipping insertion in model container [2019-12-18 17:36:15,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:36:15" (1/1) ... [2019-12-18 17:36:15,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:36:15,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:36:16,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:36:16,296 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:36:16,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:36:16,467 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:36:16,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16 WrapperNode [2019-12-18 17:36:16,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:36:16,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:36:16,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:36:16,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:36:16,478 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:36:16" (1/1) ... [2019-12-18 17:36:16,498 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:36:16" (1/1) ... [2019-12-18 17:36:16,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:36:16,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:36:16,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:36:16,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:36:16,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (1/1) ... [2019-12-18 17:36:16,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (1/1) ... [2019-12-18 17:36:16,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (1/1) ... [2019-12-18 17:36:16,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (1/1) ... [2019-12-18 17:36:16,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (1/1) ... [2019-12-18 17:36:16,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (1/1) ... [2019-12-18 17:36:16,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (1/1) ... [2019-12-18 17:36:16,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:36:16,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:36:16,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:36:16,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:36:16,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (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:36:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:36:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:36:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:36:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:36:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:36:16,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:36:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:36:16,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:36:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:36:16,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:36:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:36:16,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:36:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:36:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:36:16,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:36:16,655 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:36:17,385 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:36:17,385 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:36:17,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:36:17 BoogieIcfgContainer [2019-12-18 17:36:17,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:36:17,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:36:17,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:36:17,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:36:17,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:36:15" (1/3) ... [2019-12-18 17:36:17,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a31436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:36:17, skipping insertion in model container [2019-12-18 17:36:17,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:36:16" (2/3) ... [2019-12-18 17:36:17,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a31436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:36:17, skipping insertion in model container [2019-12-18 17:36:17,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:36:17" (3/3) ... [2019-12-18 17:36:17,396 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2019-12-18 17:36:17,406 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:36:17,406 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:36:17,419 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:36:17,420 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:36:17,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,468 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,468 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,476 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,477 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,477 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,477 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,493 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,494 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,498 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,498 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,498 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,498 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,498 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,499 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,499 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,499 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,500 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,500 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,500 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,500 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,500 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,501 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,501 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,501 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,506 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,506 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,518 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,518 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,521 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,521 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,522 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:36:17,539 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:36:17,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:36:17,562 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:36:17,563 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:36:17,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:36:17,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:36:17,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:36:17,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:36:17,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:36:17,587 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 17:36:17,589 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 17:36:17,677 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 17:36:17,677 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:36:17,695 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:36:17,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 17:36:17,762 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 17:36:17,762 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:36:17,769 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:36:17,784 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:36:17,785 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:36:22,808 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 17:36:22,962 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 17:36:23,012 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-18 17:36:23,012 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-18 17:36:23,015 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-18 17:36:25,183 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-18 17:36:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-18 17:36:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:36:25,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:25,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:36:25,195 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:36:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-18 17:36:25,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:25,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633247827] [2019-12-18 17:36:25,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:26,171 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:36:26,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633247827] [2019-12-18 17:36:26,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:26,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:36:26,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555352724] [2019-12-18 17:36:26,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:36:26,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:26,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:36:26,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:36:26,202 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-18 17:36:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:26,784 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-18 17:36:26,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:36:26,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:36:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:27,130 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 17:36:27,130 INFO L226 Difference]: Without dead ends: 33638 [2019-12-18 17:36:27,132 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:36:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-18 17:36:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-18 17:36:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-18 17:36:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-18 17:36:28,984 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-18 17:36:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:28,985 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-18 17:36:28,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:36:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-18 17:36:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:36:28,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:28,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:36:28,993 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:36:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-18 17:36:28,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:28,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584663544] [2019-12-18 17:36:28,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:29,076 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:36:29,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584663544] [2019-12-18 17:36:29,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:29,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:36:29,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911801591] [2019-12-18 17:36:29,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:36:29,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:36:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:36:29,081 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-18 17:36:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:31,026 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-18 17:36:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:36:31,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:36:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:31,293 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 17:36:31,294 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 17:36:31,295 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:36:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 17:36:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-18 17:36:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-18 17:36:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-18 17:36:33,580 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-18 17:36:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:33,580 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-18 17:36:33,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:36:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-18 17:36:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:36:33,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:33,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:36:33,584 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:36:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:33,584 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-18 17:36:33,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:33,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147129209] [2019-12-18 17:36:33,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:33,664 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:36:33,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147129209] [2019-12-18 17:36:33,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:33,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:36:33,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143479317] [2019-12-18 17:36:33,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:36:33,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:33,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:36:33,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:36:33,667 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-18 17:36:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:33,818 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-18 17:36:33,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:36:33,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:36:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:33,933 INFO L225 Difference]: With dead ends: 37462 [2019-12-18 17:36:33,933 INFO L226 Difference]: Without dead ends: 37462 [2019-12-18 17:36:33,934 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:36:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-18 17:36:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-18 17:36:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-18 17:36:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-18 17:36:37,443 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-18 17:36:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:37,444 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-18 17:36:37,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:36:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-18 17:36:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:36:37,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:37,449 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:36:37,449 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:36:37,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:37,449 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-18 17:36:37,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:37,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210528444] [2019-12-18 17:36:37,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:37,538 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:36:37,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210528444] [2019-12-18 17:36:37,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:37,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:36:37,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448232277] [2019-12-18 17:36:37,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:36:37,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:37,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:36:37,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:36:37,541 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-18 17:36:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:37,606 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-18 17:36:37,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:36:37,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:36:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:37,630 INFO L225 Difference]: With dead ends: 15610 [2019-12-18 17:36:37,630 INFO L226 Difference]: Without dead ends: 15610 [2019-12-18 17:36:37,630 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:36:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-18 17:36:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-18 17:36:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-18 17:36:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-18 17:36:38,000 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-18 17:36:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:38,001 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-18 17:36:38,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:36:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-18 17:36:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 17:36:38,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:38,003 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:36:38,003 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:36:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:38,004 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-18 17:36:38,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:38,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680982028] [2019-12-18 17:36:38,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:38,081 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:36:38,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680982028] [2019-12-18 17:36:38,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:38,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:36:38,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871627049] [2019-12-18 17:36:38,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:36:38,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:38,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:36:38,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:36:38,084 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-18 17:36:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:38,134 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-18 17:36:38,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:36:38,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 17:36:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:38,139 INFO L225 Difference]: With dead ends: 2718 [2019-12-18 17:36:38,139 INFO L226 Difference]: Without dead ends: 2718 [2019-12-18 17:36:38,140 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:36:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-18 17:36:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-18 17:36:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-18 17:36:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-18 17:36:38,188 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-18 17:36:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:38,189 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-18 17:36:38,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:36:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-18 17:36:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:36:38,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:38,194 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:36:38,194 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:36:38,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:38,194 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-18 17:36:38,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:38,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126962937] [2019-12-18 17:36:38,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:38,291 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:36:38,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126962937] [2019-12-18 17:36:38,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:38,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:36:38,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154713174] [2019-12-18 17:36:38,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:36:38,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:36:38,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:36:38,295 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-18 17:36:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:38,347 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-18 17:36:38,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:36:38,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:36:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:38,350 INFO L225 Difference]: With dead ends: 1354 [2019-12-18 17:36:38,350 INFO L226 Difference]: Without dead ends: 1354 [2019-12-18 17:36:38,351 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:36:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-18 17:36:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-18 17:36:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-18 17:36:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-18 17:36:38,374 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-18 17:36:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:38,375 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-18 17:36:38,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:36:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-18 17:36:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:36:38,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:38,382 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:36:38,382 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:36:38,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-18 17:36:38,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:38,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499979106] [2019-12-18 17:36:38,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:38,498 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:36:38,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499979106] [2019-12-18 17:36:38,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:38,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:36:38,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575307841] [2019-12-18 17:36:38,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:36:38,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:38,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:36:38,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:36:38,501 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-18 17:36:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:38,549 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-18 17:36:38,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:36:38,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:36:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:38,552 INFO L225 Difference]: With dead ends: 1222 [2019-12-18 17:36:38,553 INFO L226 Difference]: Without dead ends: 1222 [2019-12-18 17:36:38,553 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:36:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-18 17:36:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-18 17:36:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 17:36:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-18 17:36:38,578 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-18 17:36:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:38,579 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-18 17:36:38,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:36:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-18 17:36:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:36:38,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:38,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:36:38,584 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:36:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-18 17:36:38,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:38,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352414394] [2019-12-18 17:36:38,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:38,708 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:36:38,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352414394] [2019-12-18 17:36:38,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:38,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:36:38,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738158775] [2019-12-18 17:36:38,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:36:38,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:38,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:36:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:36:38,711 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 5 states. [2019-12-18 17:36:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:38,964 INFO L93 Difference]: Finished difference Result 1758 states and 5009 transitions. [2019-12-18 17:36:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:36:38,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 17:36:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:38,969 INFO L225 Difference]: With dead ends: 1758 [2019-12-18 17:36:38,969 INFO L226 Difference]: Without dead ends: 1758 [2019-12-18 17:36:38,970 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:36:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-12-18 17:36:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1413. [2019-12-18 17:36:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-18 17:36:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 4063 transitions. [2019-12-18 17:36:39,004 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 4063 transitions. Word has length 58 [2019-12-18 17:36:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:39,005 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 4063 transitions. [2019-12-18 17:36:39,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:36:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 4063 transitions. [2019-12-18 17:36:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:36:39,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:39,011 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:36:39,012 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:36:39,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:39,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2139138521, now seen corresponding path program 2 times [2019-12-18 17:36:39,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:39,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125329448] [2019-12-18 17:36:39,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:39,186 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:36:39,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125329448] [2019-12-18 17:36:39,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:39,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:36:39,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664786053] [2019-12-18 17:36:39,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:36:39,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:39,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:36:39,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:36:39,189 INFO L87 Difference]: Start difference. First operand 1413 states and 4063 transitions. Second operand 6 states. [2019-12-18 17:36:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:39,966 INFO L93 Difference]: Finished difference Result 2360 states and 6721 transitions. [2019-12-18 17:36:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:36:39,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:36:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:39,970 INFO L225 Difference]: With dead ends: 2360 [2019-12-18 17:36:39,970 INFO L226 Difference]: Without dead ends: 2360 [2019-12-18 17:36:39,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:36:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-18 17:36:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1497. [2019-12-18 17:36:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-12-18 17:36:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 4311 transitions. [2019-12-18 17:36:39,999 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 4311 transitions. Word has length 58 [2019-12-18 17:36:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:40,000 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 4311 transitions. [2019-12-18 17:36:40,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:36:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 4311 transitions. [2019-12-18 17:36:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:36:40,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:40,005 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:36:40,006 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:36:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:40,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1500936233, now seen corresponding path program 3 times [2019-12-18 17:36:40,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:40,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271958128] [2019-12-18 17:36:40,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:40,147 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:36:40,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271958128] [2019-12-18 17:36:40,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:40,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:36:40,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102027212] [2019-12-18 17:36:40,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:36:40,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:40,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:36:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:36:40,149 INFO L87 Difference]: Start difference. First operand 1497 states and 4311 transitions. Second operand 6 states. [2019-12-18 17:36:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:40,535 INFO L93 Difference]: Finished difference Result 2371 states and 6747 transitions. [2019-12-18 17:36:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:36:40,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:36:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:40,542 INFO L225 Difference]: With dead ends: 2371 [2019-12-18 17:36:40,542 INFO L226 Difference]: Without dead ends: 2371 [2019-12-18 17:36:40,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:36:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-12-18 17:36:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1685. [2019-12-18 17:36:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-18 17:36:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 4855 transitions. [2019-12-18 17:36:40,582 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 4855 transitions. Word has length 58 [2019-12-18 17:36:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:40,583 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 4855 transitions. [2019-12-18 17:36:40,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:36:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 4855 transitions. [2019-12-18 17:36:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:36:40,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:40,588 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:36:40,588 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:36:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash -774913423, now seen corresponding path program 4 times [2019-12-18 17:36:40,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:40,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728131860] [2019-12-18 17:36:40,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:40,731 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:36:40,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728131860] [2019-12-18 17:36:40,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:40,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:36:40,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016651100] [2019-12-18 17:36:40,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:36:40,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:40,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:36:40,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:36:40,734 INFO L87 Difference]: Start difference. First operand 1685 states and 4855 transitions. Second operand 7 states. [2019-12-18 17:36:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:41,233 INFO L93 Difference]: Finished difference Result 2624 states and 7473 transitions. [2019-12-18 17:36:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:36:41,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 17:36:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:41,240 INFO L225 Difference]: With dead ends: 2624 [2019-12-18 17:36:41,240 INFO L226 Difference]: Without dead ends: 2624 [2019-12-18 17:36:41,240 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:36:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-12-18 17:36:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1601. [2019-12-18 17:36:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-12-18 17:36:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 4607 transitions. [2019-12-18 17:36:41,279 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 4607 transitions. Word has length 58 [2019-12-18 17:36:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:41,280 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 4607 transitions. [2019-12-18 17:36:41,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:36:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 4607 transitions. [2019-12-18 17:36:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:36:41,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:41,284 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:36:41,284 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:36:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash -240075320, now seen corresponding path program 1 times [2019-12-18 17:36:41,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:41,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419743128] [2019-12-18 17:36:41,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:41,413 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:36:41,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419743128] [2019-12-18 17:36:41,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:41,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:36:41,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301488484] [2019-12-18 17:36:41,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:36:41,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:41,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:36:41,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:36:41,415 INFO L87 Difference]: Start difference. First operand 1601 states and 4607 transitions. Second operand 3 states. [2019-12-18 17:36:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:41,460 INFO L93 Difference]: Finished difference Result 1601 states and 4606 transitions. [2019-12-18 17:36:41,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:36:41,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:36:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:41,463 INFO L225 Difference]: With dead ends: 1601 [2019-12-18 17:36:41,463 INFO L226 Difference]: Without dead ends: 1601 [2019-12-18 17:36:41,464 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:36:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-12-18 17:36:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1076. [2019-12-18 17:36:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-18 17:36:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 3124 transitions. [2019-12-18 17:36:41,483 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 3124 transitions. Word has length 59 [2019-12-18 17:36:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:41,484 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 3124 transitions. [2019-12-18 17:36:41,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:36:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 3124 transitions. [2019-12-18 17:36:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:36:41,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:41,486 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:36:41,487 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:36:41,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:41,487 INFO L82 PathProgramCache]: Analyzing trace with hash -248733535, now seen corresponding path program 1 times [2019-12-18 17:36:41,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:41,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466846072] [2019-12-18 17:36:41,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:41,611 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:36:41,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466846072] [2019-12-18 17:36:41,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:41,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:36:41,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134157243] [2019-12-18 17:36:41,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:36:41,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:41,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:36:41,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:36:41,613 INFO L87 Difference]: Start difference. First operand 1076 states and 3124 transitions. Second operand 6 states. [2019-12-18 17:36:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:41,675 INFO L93 Difference]: Finished difference Result 1503 states and 4142 transitions. [2019-12-18 17:36:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:36:41,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 17:36:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:41,678 INFO L225 Difference]: With dead ends: 1503 [2019-12-18 17:36:41,678 INFO L226 Difference]: Without dead ends: 946 [2019-12-18 17:36:41,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:36:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2019-12-18 17:36:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2019-12-18 17:36:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-18 17:36:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2684 transitions. [2019-12-18 17:36:41,693 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2684 transitions. Word has length 59 [2019-12-18 17:36:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:41,694 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 2684 transitions. [2019-12-18 17:36:41,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:36:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2684 transitions. [2019-12-18 17:36:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:36:41,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:41,696 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:36:41,696 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:36:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1360237091, now seen corresponding path program 2 times [2019-12-18 17:36:41,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:41,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645833689] [2019-12-18 17:36:41,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:41,827 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:36:41,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645833689] [2019-12-18 17:36:41,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:41,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:36:41,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37676957] [2019-12-18 17:36:41,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:36:41,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:41,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:36:41,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:36:41,829 INFO L87 Difference]: Start difference. First operand 946 states and 2684 transitions. Second operand 6 states. [2019-12-18 17:36:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:41,915 INFO L93 Difference]: Finished difference Result 1650 states and 4366 transitions. [2019-12-18 17:36:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:36:41,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 17:36:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:41,917 INFO L225 Difference]: With dead ends: 1650 [2019-12-18 17:36:41,917 INFO L226 Difference]: Without dead ends: 921 [2019-12-18 17:36:41,918 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:36:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-18 17:36:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 689. [2019-12-18 17:36:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-18 17:36:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1725 transitions. [2019-12-18 17:36:41,932 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1725 transitions. Word has length 59 [2019-12-18 17:36:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:41,933 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1725 transitions. [2019-12-18 17:36:41,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:36:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1725 transitions. [2019-12-18 17:36:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:36:41,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:41,940 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:36:41,940 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:36:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:41,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1505400511, now seen corresponding path program 3 times [2019-12-18 17:36:41,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:41,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393629015] [2019-12-18 17:36:41,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:42,019 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:36:42,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393629015] [2019-12-18 17:36:42,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:42,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:36:42,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960038530] [2019-12-18 17:36:42,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:36:42,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:36:42,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:36:42,022 INFO L87 Difference]: Start difference. First operand 689 states and 1725 transitions. Second operand 3 states. [2019-12-18 17:36:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:42,034 INFO L93 Difference]: Finished difference Result 648 states and 1571 transitions. [2019-12-18 17:36:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:36:42,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:36:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:42,036 INFO L225 Difference]: With dead ends: 648 [2019-12-18 17:36:42,036 INFO L226 Difference]: Without dead ends: 648 [2019-12-18 17:36:42,036 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:36:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-12-18 17:36:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 600. [2019-12-18 17:36:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-18 17:36:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-18 17:36:42,048 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 59 [2019-12-18 17:36:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:42,049 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-18 17:36:42,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:36:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-18 17:36:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:36:42,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:42,051 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:36:42,051 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:36:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 1 times [2019-12-18 17:36:42,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:42,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266985248] [2019-12-18 17:36:42,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:42,157 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:36:42,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266985248] [2019-12-18 17:36:42,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:42,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:36:42,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775555483] [2019-12-18 17:36:42,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:36:42,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:36:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:36:42,161 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 5 states. [2019-12-18 17:36:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:42,206 INFO L93 Difference]: Finished difference Result 785 states and 1776 transitions. [2019-12-18 17:36:42,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:36:42,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-18 17:36:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:42,207 INFO L225 Difference]: With dead ends: 785 [2019-12-18 17:36:42,207 INFO L226 Difference]: Without dead ends: 232 [2019-12-18 17:36:42,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:36:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-18 17:36:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-12-18 17:36:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-18 17:36:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-18 17:36:42,211 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-18 17:36:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:42,212 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-18 17:36:42,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:36:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-18 17:36:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:36:42,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:42,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:36:42,213 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:36:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 2 times [2019-12-18 17:36:42,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:42,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521889958] [2019-12-18 17:36:42,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:42,574 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:36:42,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521889958] [2019-12-18 17:36:42,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:42,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:36:42,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049856219] [2019-12-18 17:36:42,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:36:42,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:42,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:36:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:36:42,579 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 13 states. [2019-12-18 17:36:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:43,140 INFO L93 Difference]: Finished difference Result 402 states and 693 transitions. [2019-12-18 17:36:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:36:43,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:36:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:43,141 INFO L225 Difference]: With dead ends: 402 [2019-12-18 17:36:43,141 INFO L226 Difference]: Without dead ends: 374 [2019-12-18 17:36:43,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:36:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-18 17:36:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2019-12-18 17:36:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 17:36:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-18 17:36:43,148 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-18 17:36:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:43,148 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-18 17:36:43,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:36:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-18 17:36:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:36:43,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:43,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:36:43,150 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:36:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 3 times [2019-12-18 17:36:43,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:43,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945605123] [2019-12-18 17:36:43,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:43,453 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:36:43,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945605123] [2019-12-18 17:36:43,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:43,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:36:43,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597915050] [2019-12-18 17:36:43,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:36:43,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:36:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:36:43,459 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 13 states. [2019-12-18 17:36:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:44,019 INFO L93 Difference]: Finished difference Result 458 states and 779 transitions. [2019-12-18 17:36:44,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:36:44,020 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:36:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:44,020 INFO L225 Difference]: With dead ends: 458 [2019-12-18 17:36:44,020 INFO L226 Difference]: Without dead ends: 430 [2019-12-18 17:36:44,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:36:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-18 17:36:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 332. [2019-12-18 17:36:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-18 17:36:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-18 17:36:44,027 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-18 17:36:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:44,028 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-18 17:36:44,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:36:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-18 17:36:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:36:44,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:44,029 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:36:44,029 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:36:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 4 times [2019-12-18 17:36:44,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:44,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044896238] [2019-12-18 17:36:44,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:36:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:36:44,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044896238] [2019-12-18 17:36:44,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:36:44,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:36:44,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033947979] [2019-12-18 17:36:44,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:36:44,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:36:44,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:36:44,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:36:44,345 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 14 states. [2019-12-18 17:36:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:36:44,873 INFO L93 Difference]: Finished difference Result 446 states and 758 transitions. [2019-12-18 17:36:44,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:36:44,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 17:36:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:36:44,875 INFO L225 Difference]: With dead ends: 446 [2019-12-18 17:36:44,875 INFO L226 Difference]: Without dead ends: 418 [2019-12-18 17:36:44,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:36:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-18 17:36:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 340. [2019-12-18 17:36:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 17:36:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-18 17:36:44,880 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-18 17:36:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:36:44,881 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-18 17:36:44,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:36:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-18 17:36:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:36:44,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:36:44,882 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:36:44,882 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:36:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:36:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 5 times [2019-12-18 17:36:44,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:36:44,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523073407] [2019-12-18 17:36:44,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:36:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:36:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:36:44,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:36:44,990 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:36:44,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1253~0.base_21|) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1253~0.base_21| 4)) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1253~0.base_21| 1)) (= v_~z$w_buff0~0_376 0) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= 0 v_~z$r_buff0_thd3~0_189) (= 0 |v_ULTIMATE.start_main_~#t1253~0.offset_17|) (= v_~__unbuffered_cnt~0_145 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1253~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1253~0.base_21|) |v_ULTIMATE.start_main_~#t1253~0.offset_17| 0)) |v_#memory_int_23|) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= v_~a~0_207 0) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1253~0.base_21|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start_main_~#t1256~0.base=|v_ULTIMATE.start_main_~#t1256~0.base_23|, ULTIMATE.start_main_~#t1256~0.offset=|v_ULTIMATE.start_main_~#t1256~0.offset_18|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ULTIMATE.start_main_~#t1253~0.offset=|v_ULTIMATE.start_main_~#t1253~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_~#t1255~0.offset=|v_ULTIMATE.start_main_~#t1255~0.offset_18|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ULTIMATE.start_main_~#t1254~0.offset=|v_ULTIMATE.start_main_~#t1254~0.offset_18|, ULTIMATE.start_main_~#t1253~0.base=|v_ULTIMATE.start_main_~#t1253~0.base_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ULTIMATE.start_main_~#t1254~0.base=|v_ULTIMATE.start_main_~#t1254~0.base_23|, ULTIMATE.start_main_~#t1255~0.base=|v_ULTIMATE.start_main_~#t1255~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77} 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, ULTIMATE.start_main_~#t1256~0.base, ULTIMATE.start_main_~#t1256~0.offset, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1253~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1255~0.offset, 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, ULTIMATE.start_main_~#t1254~0.offset, ULTIMATE.start_main_~#t1253~0.base, ~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, ~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_#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, ULTIMATE.start_main_~#t1254~0.base, ULTIMATE.start_main_~#t1255~0.base, ~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_#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_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #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:36:44,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1254~0.base_13| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1254~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1254~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1254~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1254~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1254~0.base_13|) |v_ULTIMATE.start_main_~#t1254~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1254~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1254~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1254~0.offset=|v_ULTIMATE.start_main_~#t1254~0.offset_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1254~0.base=|v_ULTIMATE.start_main_~#t1254~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1254~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1254~0.base] because there is no mapped edge [2019-12-18 17:36:44,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1255~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1255~0.offset_10| 0) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1255~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1255~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1255~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1255~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1255~0.base_11|) |v_ULTIMATE.start_main_~#t1255~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1255~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1255~0.base=|v_ULTIMATE.start_main_~#t1255~0.base_11|, ULTIMATE.start_main_~#t1255~0.offset=|v_ULTIMATE.start_main_~#t1255~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1255~0.base, ULTIMATE.start_main_~#t1255~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:36:44,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1256~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1256~0.base_13|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1256~0.base_13|) (= |v_ULTIMATE.start_main_~#t1256~0.offset_11| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1256~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1256~0.base_13|) |v_ULTIMATE.start_main_~#t1256~0.offset_11| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1256~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1256~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1256~0.offset=|v_ULTIMATE.start_main_~#t1256~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1256~0.base=|v_ULTIMATE.start_main_~#t1256~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1256~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1256~0.base] because there is no mapped edge [2019-12-18 17:36:44,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} 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:36:44,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:36:44,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, 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:36:45,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-897032410 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-897032410 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-897032410|) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out-897032410| ~z$w_buff0_used~0_In-897032410) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-897032410, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-897032410} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-897032410, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-897032410, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-897032410|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:36:45,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2020503680 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2020503680 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In2020503680 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2020503680 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out2020503680|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In2020503680 |P3Thread1of1ForFork3_#t~ite12_Out2020503680|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2020503680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020503680, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2020503680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020503680} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2020503680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020503680, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2020503680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020503680, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out2020503680|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:36:45,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-91559542 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-91559542 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-91559542 |P2Thread1of1ForFork2_#t~ite3_Out-91559542|)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-91559542 |P2Thread1of1ForFork2_#t~ite3_Out-91559542|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-91559542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-91559542, ~z$w_buff1~0=~z$w_buff1~0_In-91559542, ~z~0=~z~0_In-91559542} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-91559542|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-91559542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-91559542, ~z$w_buff1~0=~z$w_buff1~0_In-91559542, ~z~0=~z~0_In-91559542} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:36:45,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:36:45,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In520517727 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In520517727 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out520517727| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out520517727| ~z$w_buff0_used~0_In520517727)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In520517727, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In520517727} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out520517727|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In520517727, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In520517727} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:36:45,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-831849612 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-831849612 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-831849612 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-831849612 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-831849612|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-831849612 |P2Thread1of1ForFork2_#t~ite6_Out-831849612|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-831849612, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-831849612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-831849612, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-831849612} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-831849612|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-831849612, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-831849612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-831849612, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-831849612} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:36:45,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In909101464 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In909101464 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out909101464| ~z$r_buff0_thd3~0_In909101464)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out909101464| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In909101464, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In909101464} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In909101464, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In909101464, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out909101464|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:36:45,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2119333713 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2119333713 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In2119333713 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2119333713 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out2119333713| 0)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out2119333713| ~z$r_buff1_thd3~0_In2119333713) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2119333713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2119333713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2119333713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2119333713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2119333713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2119333713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2119333713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2119333713, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2119333713|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:36:45,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} 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:36:45,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1730122304 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1730122304 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1730122304 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out-1730122304 ~z$r_buff0_thd4~0_In-1730122304)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1730122304, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1730122304} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1730122304, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1730122304, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1730122304|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:36:45,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In387300443 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In387300443 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In387300443 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In387300443 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out387300443| 0)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out387300443| ~z$r_buff1_thd4~0_In387300443) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In387300443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In387300443, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In387300443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In387300443} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In387300443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In387300443, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out387300443|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In387300443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In387300443} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:36:45,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, 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:36:45,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 17:36:45,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-462922718 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-462922718 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-462922718| |ULTIMATE.start_main_#t~ite20_Out-462922718|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-462922718| ~z$w_buff1~0_In-462922718) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite19_Out-462922718| ~z~0_In-462922718)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-462922718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-462922718, ~z$w_buff1~0=~z$w_buff1~0_In-462922718, ~z~0=~z~0_In-462922718} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-462922718|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-462922718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-462922718, ~z$w_buff1~0=~z$w_buff1~0_In-462922718, ~z~0=~z~0_In-462922718, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-462922718|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:36:45,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In878058327 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In878058327 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out878058327|)) (and (= ~z$w_buff0_used~0_In878058327 |ULTIMATE.start_main_#t~ite21_Out878058327|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In878058327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In878058327} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In878058327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In878058327, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out878058327|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:36:45,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1836602304 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1836602304 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1836602304 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1836602304 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1836602304|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1836602304 |ULTIMATE.start_main_#t~ite22_Out-1836602304|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1836602304, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1836602304, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1836602304, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1836602304} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1836602304, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1836602304, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1836602304, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1836602304, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1836602304|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:36:45,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1865025994 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1865025994 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1865025994 |ULTIMATE.start_main_#t~ite23_Out1865025994|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out1865025994|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1865025994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1865025994} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1865025994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1865025994, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1865025994|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:36:45,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1616143509 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1616143509 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1616143509 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1616143509 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-1616143509| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out-1616143509| ~z$r_buff1_thd0~0_In-1616143509)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1616143509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1616143509, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1616143509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1616143509} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1616143509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1616143509, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1616143509, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1616143509|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1616143509} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:36:45,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1697924190 256)))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out1697924190| ~z$w_buff0~0_In1697924190) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1697924190 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1697924190 256) 0) (and (= (mod ~z$w_buff1_used~0_In1697924190 256) 0) .cse0) (and (= (mod ~z$r_buff1_thd0~0_In1697924190 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite31_Out1697924190| |ULTIMATE.start_main_#t~ite30_Out1697924190|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite31_Out1697924190| ~z$w_buff0~0_In1697924190) (= |ULTIMATE.start_main_#t~ite30_In1697924190| |ULTIMATE.start_main_#t~ite30_Out1697924190|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1697924190, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In1697924190|, ~z$w_buff0~0=~z$w_buff0~0_In1697924190, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1697924190, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1697924190, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1697924190, ~weak$$choice2~0=~weak$$choice2~0_In1697924190} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1697924190, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1697924190|, ~z$w_buff0~0=~z$w_buff0~0_In1697924190, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1697924190, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1697924190, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1697924190, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1697924190|, ~weak$$choice2~0=~weak$$choice2~0_In1697924190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-18 17:36:45,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2136447609 256) 0))) (or (and (= ~z$w_buff1~0_In-2136447609 |ULTIMATE.start_main_#t~ite34_Out-2136447609|) (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In-2136447609| |ULTIMATE.start_main_#t~ite33_Out-2136447609|)) (and (= ~z$w_buff1~0_In-2136447609 |ULTIMATE.start_main_#t~ite33_Out-2136447609|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2136447609 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-2136447609 256)) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In-2136447609 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-2136447609 256)))) .cse0 (= |ULTIMATE.start_main_#t~ite34_Out-2136447609| |ULTIMATE.start_main_#t~ite33_Out-2136447609|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2136447609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136447609, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2136447609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2136447609, ~z$w_buff1~0=~z$w_buff1~0_In-2136447609, ~weak$$choice2~0=~weak$$choice2~0_In-2136447609, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-2136447609|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2136447609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136447609, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2136447609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2136447609, ~z$w_buff1~0=~z$w_buff1~0_In-2136447609, ~weak$$choice2~0=~weak$$choice2~0_In-2136447609, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-2136447609|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2136447609|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 17:36:45,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} 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:36:45,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1988657142 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite45_Out-1988657142| ~z$r_buff1_thd0~0_In-1988657142) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1988657142 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1988657142 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1988657142 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1988657142 256))))) (= |ULTIMATE.start_main_#t~ite46_Out-1988657142| |ULTIMATE.start_main_#t~ite45_Out-1988657142|)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1988657142| ~z$r_buff1_thd0~0_In-1988657142) (= |ULTIMATE.start_main_#t~ite45_In-1988657142| |ULTIMATE.start_main_#t~ite45_Out-1988657142|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1988657142, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1988657142, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1988657142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1988657142, ~weak$$choice2~0=~weak$$choice2~0_In-1988657142, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1988657142|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1988657142, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1988657142, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1988657142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1988657142, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1988657142|, ~weak$$choice2~0=~weak$$choice2~0_In-1988657142, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1988657142|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:36:45,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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:36:45,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:36:45,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:36:45 BasicIcfg [2019-12-18 17:36:45,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:36:45,108 INFO L168 Benchmark]: Toolchain (without parser) took 29409.92 ms. Allocated memory was 138.4 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 100.9 MB in the beginning and 836.1 MB in the end (delta: -735.2 MB). Peak memory consumption was 435.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:36:45,108 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 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:36:45,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.06 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:36:45,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.16 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.1 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:36:45,110 INFO L168 Benchmark]: Boogie Preprocessor took 38.84 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.4 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:36:45,111 INFO L168 Benchmark]: RCFGBuilder took 809.72 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 101.4 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:36:45,112 INFO L168 Benchmark]: TraceAbstraction took 27717.87 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 100.7 MB in the beginning and 836.1 MB in the end (delta: -735.4 MB). Peak memory consumption was 370.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:36:45,115 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.75 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.06 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.16 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.84 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.72 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 101.4 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27717.87 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 100.7 MB in the beginning and 836.1 MB in the end (delta: -735.4 MB). Peak memory consumption was 370.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L833] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L835] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L837] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] 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 [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, 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] [L808] 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) [L772] 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_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=2, 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] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 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 [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 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 [L843] EXPR 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_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=2, 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] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 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 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, 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] [L854] 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_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=2, 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] [L854] 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) [L855] 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)) [L856] 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)) [L857] 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_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=2, 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_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)) [L858] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, 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_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)) [L860] 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)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1996 SDtfs, 1974 SDslu, 5304 SDs, 0 SdLazy, 2492 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 35 SyntacticMatches, 12 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred 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: 8.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 8665 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 199904 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...