/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:04:30,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:04:30,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:04:30,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:04:30,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:04:30,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:04:30,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:04:30,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:04:30,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:04:30,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:04:30,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:04:30,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:04:30,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:04:30,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:04:30,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:04:30,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:04:30,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:04:30,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:04:30,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:04:30,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:04:30,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:04:30,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:04:30,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:04:30,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:04:30,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:04:30,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:04:30,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:04:30,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:04:30,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:04:30,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:04:30,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:04:30,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:04:30,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:04:30,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:04:30,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:04:30,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:04:30,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:04:30,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:04:30,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:04:30,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:04:30,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:04:30,580 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 19:04:30,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:04:30,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:04:30,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:04:30,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:04:30,598 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:04:30,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:04:30,598 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:04:30,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:04:30,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:04:30,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:04:30,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:04:30,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:04:30,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:04:30,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:04:30,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:04:30,600 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:04:30,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:04:30,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:04:30,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:04:30,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:04:30,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:04:30,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:04:30,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:04:30,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:04:30,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:04:30,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:04:30,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:04:30,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:04:30,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:04:30,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:04:30,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:04:30,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:04:30,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:04:30,922 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:04:30,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-18 19:04:30,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2fd1bef/570a110f952c4040a0aa528cb084d555/FLAGa38945801 [2019-12-18 19:04:31,556 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:04:31,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-18 19:04:31,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2fd1bef/570a110f952c4040a0aa528cb084d555/FLAGa38945801 [2019-12-18 19:04:31,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2fd1bef/570a110f952c4040a0aa528cb084d555 [2019-12-18 19:04:31,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:04:31,840 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:04:31,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:31,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:04:31,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:04:31,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:31" (1/1) ... [2019-12-18 19:04:31,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614afbea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:31, skipping insertion in model container [2019-12-18 19:04:31,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:31" (1/1) ... [2019-12-18 19:04:31,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:04:31,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:04:32,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:32,483 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:04:32,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:32,656 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:04:32,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32 WrapperNode [2019-12-18 19:04:32,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:32,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:32,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:04:32,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:04:32,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:32,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:04:32,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:04:32,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:04:32,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (1/1) ... [2019-12-18 19:04:32,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:04:32,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:04:32,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:04:32,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:04:32,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (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 19:04:32,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:04:32,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:04:32,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:04:32,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:04:32,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:04:32,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:04:32,846 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:04:32,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:04:32,847 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:04:32,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:04:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:04:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:04:32,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:04:32,852 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 19:04:33,655 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:04:33,655 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:04:33,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:33 BoogieIcfgContainer [2019-12-18 19:04:33,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:04:33,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:04:33,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:04:33,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:04:33,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:04:31" (1/3) ... [2019-12-18 19:04:33,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c52a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:33, skipping insertion in model container [2019-12-18 19:04:33,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:32" (2/3) ... [2019-12-18 19:04:33,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c52a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:33, skipping insertion in model container [2019-12-18 19:04:33,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:33" (3/3) ... [2019-12-18 19:04:33,667 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2019-12-18 19:04:33,678 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:04:33,678 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:04:33,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:04:33,687 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:04:33,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,738 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,738 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,739 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,739 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,739 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,751 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,752 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,756 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,756 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:33,776 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:04:33,796 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:04:33,796 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:04:33,796 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:04:33,797 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:04:33,797 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:04:33,797 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:04:33,797 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:04:33,797 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:04:33,834 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-18 19:04:33,836 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 19:04:33,928 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 19:04:33,929 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:33,943 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 19:04:33,963 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 19:04:34,009 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 19:04:34,010 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:34,016 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 19:04:34,030 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 19:04:34,031 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:04:39,142 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 19:04:39,247 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 19:04:39,273 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46210 [2019-12-18 19:04:39,273 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 19:04:39,276 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 86 transitions [2019-12-18 19:04:40,102 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15658 states. [2019-12-18 19:04:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states. [2019-12-18 19:04:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:04:40,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:40,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:40,111 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 430910871, now seen corresponding path program 1 times [2019-12-18 19:04:40,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:40,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519582397] [2019-12-18 19:04:40,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:40,366 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 19:04:40,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519582397] [2019-12-18 19:04:40,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:40,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:04:40,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045089638] [2019-12-18 19:04:40,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:40,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:40,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:40,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:40,393 INFO L87 Difference]: Start difference. First operand 15658 states. Second operand 3 states. [2019-12-18 19:04:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:40,873 INFO L93 Difference]: Finished difference Result 15586 states and 57554 transitions. [2019-12-18 19:04:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:40,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 19:04:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:41,044 INFO L225 Difference]: With dead ends: 15586 [2019-12-18 19:04:41,045 INFO L226 Difference]: Without dead ends: 15248 [2019-12-18 19:04:41,046 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 19:04:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15248 states. [2019-12-18 19:04:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15248 to 15248. [2019-12-18 19:04:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15248 states. [2019-12-18 19:04:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 56345 transitions. [2019-12-18 19:04:42,567 INFO L78 Accepts]: Start accepts. Automaton has 15248 states and 56345 transitions. Word has length 7 [2019-12-18 19:04:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:42,568 INFO L462 AbstractCegarLoop]: Abstraction has 15248 states and 56345 transitions. [2019-12-18 19:04:42,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 15248 states and 56345 transitions. [2019-12-18 19:04:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:04:42,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:42,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:42,575 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1550259791, now seen corresponding path program 1 times [2019-12-18 19:04:42,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:42,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53957613] [2019-12-18 19:04:42,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:42,734 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 19:04:42,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53957613] [2019-12-18 19:04:42,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:42,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:42,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824324537] [2019-12-18 19:04:42,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:42,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:42,738 INFO L87 Difference]: Start difference. First operand 15248 states and 56345 transitions. Second operand 4 states. [2019-12-18 19:04:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:43,420 INFO L93 Difference]: Finished difference Result 24364 states and 86703 transitions. [2019-12-18 19:04:43,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:43,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:04:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:43,533 INFO L225 Difference]: With dead ends: 24364 [2019-12-18 19:04:43,533 INFO L226 Difference]: Without dead ends: 24350 [2019-12-18 19:04:43,535 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 19:04:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2019-12-18 19:04:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21678. [2019-12-18 19:04:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2019-12-18 19:04:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 78082 transitions. [2019-12-18 19:04:44,549 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 78082 transitions. Word has length 13 [2019-12-18 19:04:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:44,550 INFO L462 AbstractCegarLoop]: Abstraction has 21678 states and 78082 transitions. [2019-12-18 19:04:44,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 78082 transitions. [2019-12-18 19:04:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:04:44,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:44,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:44,556 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1785022215, now seen corresponding path program 1 times [2019-12-18 19:04:44,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:44,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201592573] [2019-12-18 19:04:44,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:44,629 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 19:04:44,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201592573] [2019-12-18 19:04:44,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:44,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:44,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946256059] [2019-12-18 19:04:44,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:44,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:44,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:44,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:44,632 INFO L87 Difference]: Start difference. First operand 21678 states and 78082 transitions. Second operand 3 states. [2019-12-18 19:04:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:44,699 INFO L93 Difference]: Finished difference Result 12388 states and 38538 transitions. [2019-12-18 19:04:44,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:44,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 19:04:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:44,746 INFO L225 Difference]: With dead ends: 12388 [2019-12-18 19:04:44,746 INFO L226 Difference]: Without dead ends: 12388 [2019-12-18 19:04:44,747 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 19:04:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2019-12-18 19:04:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 12388. [2019-12-18 19:04:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-12-18 19:04:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 38538 transitions. [2019-12-18 19:04:46,074 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 38538 transitions. Word has length 13 [2019-12-18 19:04:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:46,077 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 38538 transitions. [2019-12-18 19:04:46,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 38538 transitions. [2019-12-18 19:04:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:04:46,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:46,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:46,084 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:46,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1922152669, now seen corresponding path program 1 times [2019-12-18 19:04:46,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:46,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545147042] [2019-12-18 19:04:46,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:46,152 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 19:04:46,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545147042] [2019-12-18 19:04:46,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:46,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:46,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926925796] [2019-12-18 19:04:46,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:46,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:46,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:46,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:46,154 INFO L87 Difference]: Start difference. First operand 12388 states and 38538 transitions. Second operand 4 states. [2019-12-18 19:04:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:46,181 INFO L93 Difference]: Finished difference Result 1903 states and 4374 transitions. [2019-12-18 19:04:46,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:04:46,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 19:04:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:46,189 INFO L225 Difference]: With dead ends: 1903 [2019-12-18 19:04:46,189 INFO L226 Difference]: Without dead ends: 1903 [2019-12-18 19:04:46,190 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 19:04:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-18 19:04:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2019-12-18 19:04:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-18 19:04:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4374 transitions. [2019-12-18 19:04:46,223 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4374 transitions. Word has length 14 [2019-12-18 19:04:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:46,223 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4374 transitions. [2019-12-18 19:04:46,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4374 transitions. [2019-12-18 19:04:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 19:04:46,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:46,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:46,226 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:46,226 INFO L82 PathProgramCache]: Analyzing trace with hash -560054606, now seen corresponding path program 1 times [2019-12-18 19:04:46,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:46,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174439088] [2019-12-18 19:04:46,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:46,284 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 19:04:46,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174439088] [2019-12-18 19:04:46,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:46,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:46,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288806241] [2019-12-18 19:04:46,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:46,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:46,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:46,287 INFO L87 Difference]: Start difference. First operand 1903 states and 4374 transitions. Second operand 5 states. [2019-12-18 19:04:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:46,314 INFO L93 Difference]: Finished difference Result 669 states and 1571 transitions. [2019-12-18 19:04:46,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:46,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 19:04:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:46,316 INFO L225 Difference]: With dead ends: 669 [2019-12-18 19:04:46,316 INFO L226 Difference]: Without dead ends: 669 [2019-12-18 19:04:46,317 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 19:04:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-18 19:04:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 599. [2019-12-18 19:04:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-18 19:04:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1406 transitions. [2019-12-18 19:04:46,328 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1406 transitions. Word has length 26 [2019-12-18 19:04:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:46,328 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1406 transitions. [2019-12-18 19:04:46,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1406 transitions. [2019-12-18 19:04:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:46,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:46,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:46,331 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 958609681, now seen corresponding path program 1 times [2019-12-18 19:04:46,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:46,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499277300] [2019-12-18 19:04:46,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:46,400 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 19:04:46,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499277300] [2019-12-18 19:04:46,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:46,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:46,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194374468] [2019-12-18 19:04:46,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:46,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:46,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:46,402 INFO L87 Difference]: Start difference. First operand 599 states and 1406 transitions. Second operand 3 states. [2019-12-18 19:04:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:46,439 INFO L93 Difference]: Finished difference Result 610 states and 1420 transitions. [2019-12-18 19:04:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:46,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 19:04:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:46,442 INFO L225 Difference]: With dead ends: 610 [2019-12-18 19:04:46,442 INFO L226 Difference]: Without dead ends: 610 [2019-12-18 19:04:46,442 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 19:04:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-18 19:04:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2019-12-18 19:04:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 19:04:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1415 transitions. [2019-12-18 19:04:46,452 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1415 transitions. Word has length 54 [2019-12-18 19:04:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:46,453 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1415 transitions. [2019-12-18 19:04:46,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1415 transitions. [2019-12-18 19:04:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:46,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:46,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:46,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:46,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1927722319, now seen corresponding path program 1 times [2019-12-18 19:04:46,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:46,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248804313] [2019-12-18 19:04:46,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:46,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248804313] [2019-12-18 19:04:46,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:46,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:46,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469598372] [2019-12-18 19:04:46,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:46,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:46,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:46,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:46,578 INFO L87 Difference]: Start difference. First operand 605 states and 1415 transitions. Second operand 3 states. [2019-12-18 19:04:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:46,623 INFO L93 Difference]: Finished difference Result 605 states and 1414 transitions. [2019-12-18 19:04:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:46,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 19:04:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:46,626 INFO L225 Difference]: With dead ends: 605 [2019-12-18 19:04:46,627 INFO L226 Difference]: Without dead ends: 605 [2019-12-18 19:04:46,628 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 19:04:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-12-18 19:04:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 498. [2019-12-18 19:04:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-18 19:04:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1175 transitions. [2019-12-18 19:04:46,637 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1175 transitions. Word has length 54 [2019-12-18 19:04:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:46,638 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1175 transitions. [2019-12-18 19:04:46,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1175 transitions. [2019-12-18 19:04:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:04:46,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:46,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:46,640 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:46,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 234191309, now seen corresponding path program 1 times [2019-12-18 19:04:46,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:46,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294031658] [2019-12-18 19:04:46,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:46,869 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 19:04:46,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294031658] [2019-12-18 19:04:46,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:46,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:46,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790412509] [2019-12-18 19:04:46,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:46,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:46,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:46,871 INFO L87 Difference]: Start difference. First operand 498 states and 1175 transitions. Second operand 6 states. [2019-12-18 19:04:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:46,944 INFO L93 Difference]: Finished difference Result 892 states and 1916 transitions. [2019-12-18 19:04:46,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:46,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 19:04:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:46,946 INFO L225 Difference]: With dead ends: 892 [2019-12-18 19:04:46,946 INFO L226 Difference]: Without dead ends: 579 [2019-12-18 19:04:46,947 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 19:04:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-18 19:04:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 436. [2019-12-18 19:04:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-18 19:04:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 995 transitions. [2019-12-18 19:04:46,956 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 995 transitions. Word has length 55 [2019-12-18 19:04:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:46,956 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 995 transitions. [2019-12-18 19:04:46,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 995 transitions. [2019-12-18 19:04:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:04:46,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:46,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:46,959 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2101224341, now seen corresponding path program 2 times [2019-12-18 19:04:46,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:46,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992694139] [2019-12-18 19:04:46,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:47,080 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 19:04:47,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992694139] [2019-12-18 19:04:47,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:47,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:47,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23095956] [2019-12-18 19:04:47,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:47,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:47,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:47,083 INFO L87 Difference]: Start difference. First operand 436 states and 995 transitions. Second operand 6 states. [2019-12-18 19:04:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:47,155 INFO L93 Difference]: Finished difference Result 707 states and 1580 transitions. [2019-12-18 19:04:47,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:47,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 19:04:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:47,156 INFO L225 Difference]: With dead ends: 707 [2019-12-18 19:04:47,156 INFO L226 Difference]: Without dead ends: 244 [2019-12-18 19:04:47,157 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 19:04:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-18 19:04:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 220. [2019-12-18 19:04:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-18 19:04:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 399 transitions. [2019-12-18 19:04:47,161 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 399 transitions. Word has length 55 [2019-12-18 19:04:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:47,161 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 399 transitions. [2019-12-18 19:04:47,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 399 transitions. [2019-12-18 19:04:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:04:47,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:47,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:47,163 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1069188449, now seen corresponding path program 3 times [2019-12-18 19:04:47,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:47,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109825699] [2019-12-18 19:04:47,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:47,267 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 19:04:47,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109825699] [2019-12-18 19:04:47,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:47,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:47,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802579006] [2019-12-18 19:04:47,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:47,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:47,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:47,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:47,269 INFO L87 Difference]: Start difference. First operand 220 states and 399 transitions. Second operand 5 states. [2019-12-18 19:04:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:47,544 INFO L93 Difference]: Finished difference Result 351 states and 635 transitions. [2019-12-18 19:04:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:47,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 19:04:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:47,546 INFO L225 Difference]: With dead ends: 351 [2019-12-18 19:04:47,546 INFO L226 Difference]: Without dead ends: 351 [2019-12-18 19:04:47,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-12-18 19:04:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 244. [2019-12-18 19:04:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-18 19:04:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 446 transitions. [2019-12-18 19:04:47,552 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 446 transitions. Word has length 55 [2019-12-18 19:04:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:47,552 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 446 transitions. [2019-12-18 19:04:47,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 446 transitions. [2019-12-18 19:04:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:04:47,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:47,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:47,553 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1026592769, now seen corresponding path program 4 times [2019-12-18 19:04:47,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:47,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639184508] [2019-12-18 19:04:47,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:47,605 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 19:04:47,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639184508] [2019-12-18 19:04:47,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:47,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:47,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585421274] [2019-12-18 19:04:47,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:47,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:47,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:47,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:47,607 INFO L87 Difference]: Start difference. First operand 244 states and 446 transitions. Second operand 3 states. [2019-12-18 19:04:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:47,629 INFO L93 Difference]: Finished difference Result 244 states and 432 transitions. [2019-12-18 19:04:47,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:47,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 19:04:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:47,630 INFO L225 Difference]: With dead ends: 244 [2019-12-18 19:04:47,630 INFO L226 Difference]: Without dead ends: 244 [2019-12-18 19:04:47,631 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 19:04:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-18 19:04:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 220. [2019-12-18 19:04:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-18 19:04:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2019-12-18 19:04:47,635 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 55 [2019-12-18 19:04:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:47,635 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2019-12-18 19:04:47,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2019-12-18 19:04:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 19:04:47,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:47,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:47,636 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1590264344, now seen corresponding path program 1 times [2019-12-18 19:04:47,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:47,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521775391] [2019-12-18 19:04:47,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:47,953 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 19:04:47,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521775391] [2019-12-18 19:04:47,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:47,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:04:47,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455331523] [2019-12-18 19:04:47,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:04:47,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:04:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:04:47,956 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand 13 states. [2019-12-18 19:04:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:48,503 INFO L93 Difference]: Finished difference Result 392 states and 672 transitions. [2019-12-18 19:04:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:04:48,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 19:04:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:48,504 INFO L225 Difference]: With dead ends: 392 [2019-12-18 19:04:48,505 INFO L226 Difference]: Without dead ends: 362 [2019-12-18 19:04:48,505 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 19:04:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-18 19:04:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 320. [2019-12-18 19:04:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 19:04:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 558 transitions. [2019-12-18 19:04:48,511 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 558 transitions. Word has length 56 [2019-12-18 19:04:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:48,511 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 558 transitions. [2019-12-18 19:04:48,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:04:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 558 transitions. [2019-12-18 19:04:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 19:04:48,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:48,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:48,517 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1710889504, now seen corresponding path program 2 times [2019-12-18 19:04:48,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:48,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707461804] [2019-12-18 19:04:48,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:48,821 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 19:04:48,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707461804] [2019-12-18 19:04:48,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:48,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:04:48,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473568187] [2019-12-18 19:04:48,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:04:48,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:48,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:04:48,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:04:48,825 INFO L87 Difference]: Start difference. First operand 320 states and 558 transitions. Second operand 12 states. [2019-12-18 19:04:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:49,182 INFO L93 Difference]: Finished difference Result 420 states and 708 transitions. [2019-12-18 19:04:49,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:04:49,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 19:04:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:49,184 INFO L225 Difference]: With dead ends: 420 [2019-12-18 19:04:49,184 INFO L226 Difference]: Without dead ends: 390 [2019-12-18 19:04:49,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:04:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-18 19:04:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 328. [2019-12-18 19:04:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 19:04:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 572 transitions. [2019-12-18 19:04:49,191 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 572 transitions. Word has length 56 [2019-12-18 19:04:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:49,191 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 572 transitions. [2019-12-18 19:04:49,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:04:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 572 transitions. [2019-12-18 19:04:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 19:04:49,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:49,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:49,193 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1475134232, now seen corresponding path program 3 times [2019-12-18 19:04:49,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:49,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368358269] [2019-12-18 19:04:49,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:49,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:04:49,293 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:04:49,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_54) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2492~0.base_27|) (= 0 v_~y$r_buff1_thd3~0_115) (= 0 v_~y$r_buff1_thd2~0_106) (= v_~weak$$choice2~0_112 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$w_buff0_used~0_737 0) (= v_~y$w_buff1~0_230 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd3~0_169) (= 0 v_~y$w_buff0~0_338) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_108) (= (store .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27| 1) |v_#valid_59|) (= v_~y$mem_tmp~0_19 0) (= v_~z~0_90 0) (= v_~x~0_77 0) (= v_~y$w_buff1_used~0_407 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_90) (= v_~y$r_buff1_thd0~0_237 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2492~0.base_27| 4) |v_#length_25|) (= 0 |v_ULTIMATE.start_main_~#t2492~0.offset_20|) (= 0 v_~y$flush_delayed~0_38) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= 0 |v_#NULL.base_5|) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27|) |v_ULTIMATE.start_main_~#t2492~0.offset_20| 0))) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_34|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_62|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_71|, ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_20|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_115, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_25|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_16|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_118|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_17|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_45|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_34|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_37|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_~#t2492~0.offset=|v_ULTIMATE.start_main_~#t2492~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~x~0=v_~x~0_77, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_737, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_45|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_37|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_20|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_43|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_24|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_37|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_206|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_~#t2492~0.base=|v_ULTIMATE.start_main_~#t2492~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_114|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_42|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2494~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2494~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2493~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2492~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t2493~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2492~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:04:49,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L798-1-->L800: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2493~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t2493~0.offset_9| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9|) |v_ULTIMATE.start_main_~#t2493~0.offset_9| 1))) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2493~0.base_9| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2493~0.offset, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2493~0.base] because there is no mapped edge [2019-12-18 19:04:49,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L800-1-->L802: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10|) |v_ULTIMATE.start_main_~#t2494~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10| 1) |v_#valid_31|) (not (= 0 |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2494~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2494~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t2494~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2494~0.offset] because there is no mapped edge [2019-12-18 19:04:49,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P2ENTRY-->L4-3: Formula: (and (= (mod ~y$w_buff1_used~0_Out-1250810143 256) 0) (= ~y$w_buff1~0_Out-1250810143 ~y$w_buff0~0_In-1250810143) (= 1 ~y$w_buff0_used~0_Out-1250810143) (= ~y$w_buff1_used~0_Out-1250810143 ~y$w_buff0_used~0_In-1250810143) (= |P2Thread1of1ForFork0_#in~arg.offset_In-1250810143| P2Thread1of1ForFork0_~arg.offset_Out-1250810143) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1250810143 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1250810143|) (= 1 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1250810143|) (= P2Thread1of1ForFork0_~arg.base_Out-1250810143 |P2Thread1of1ForFork0_#in~arg.base_In-1250810143|) (= ~y$w_buff0~0_Out-1250810143 2)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-1250810143|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1250810143, ~y$w_buff0~0=~y$w_buff0~0_In-1250810143, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-1250810143|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-1250810143, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1250810143|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-1250810143|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1250810143, ~y$w_buff1~0=~y$w_buff1~0_Out-1250810143, ~y$w_buff0~0=~y$w_buff0~0_Out-1250810143, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-1250810143, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-1250810143|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1250810143, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1250810143} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:04:49,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_60 1) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~z~0_51 2) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z~0=v_~z~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_60, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 19:04:49,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In662553720 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In662553720 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out662553720| ~y$w_buff0_used~0_In662553720) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out662553720| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In662553720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In662553720} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In662553720, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out662553720|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In662553720} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 19:04:49,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out-2035873701| |P1Thread1of1ForFork2_#t~ite3_Out-2035873701|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2035873701 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2035873701 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite3_Out-2035873701| ~y$w_buff1~0_In-2035873701) (not .cse1) (not .cse2)) (and .cse0 (= ~y~0_In-2035873701 |P1Thread1of1ForFork2_#t~ite3_Out-2035873701|) (or .cse1 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2035873701, ~y$w_buff1~0=~y$w_buff1~0_In-2035873701, ~y~0=~y~0_In-2035873701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035873701} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2035873701, ~y$w_buff1~0=~y$w_buff1~0_In-2035873701, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-2035873701|, ~y~0=~y~0_In-2035873701, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-2035873701|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035873701} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 19:04:49,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-225974647 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-225974647 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-225974647 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-225974647 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out-225974647| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out-225974647| ~y$w_buff1_used~0_In-225974647)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-225974647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-225974647, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-225974647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-225974647} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-225974647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-225974647, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-225974647|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-225974647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-225974647} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 19:04:49,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1282643823 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1282643823 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out1282643823| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1282643823 |P1Thread1of1ForFork2_#t~ite5_Out1282643823|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1282643823, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1282643823} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1282643823, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1282643823, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1282643823|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 19:04:49,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-56308106 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-56308106 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-56308106 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-56308106 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out-56308106| ~y$w_buff1_used~0_In-56308106)) (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-56308106|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-56308106, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-56308106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-56308106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-56308106} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-56308106, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-56308106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-56308106, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-56308106|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-56308106} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 19:04:49,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1196371433 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1196371433 256)))) (or (and (= ~y$r_buff0_thd2~0_In1196371433 |P1Thread1of1ForFork2_#t~ite7_Out1196371433|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out1196371433|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1196371433, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1196371433} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1196371433, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1196371433, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1196371433|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 19:04:49,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-409436939 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-409436939 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-409436939 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-409436939 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-409436939| ~y$r_buff1_thd2~0_In-409436939) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-409436939| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-409436939, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-409436939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-409436939, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-409436939} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-409436939, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-409436939, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-409436939|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-409436939, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-409436939} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 19:04:49,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_36| v_~y$r_buff1_thd2~0_71) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_71, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 19:04:49,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2073355955 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2073355955 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out2073355955) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In2073355955 ~y$r_buff0_thd3~0_Out2073355955)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2073355955, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2073355955} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2073355955, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2073355955, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out2073355955|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 19:04:49,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1460117812 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1460117812 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1460117812 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1460117812 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out1460117812| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite14_Out1460117812| ~y$r_buff1_thd3~0_In1460117812)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1460117812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1460117812, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1460117812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1460117812} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1460117812|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1460117812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1460117812, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1460117812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1460117812} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 19:04:49,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_34| v_~y$r_buff1_thd3~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_66, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 19:04:49,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 19:04:49,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out-1773466562| |ULTIMATE.start_main_#t~ite18_Out-1773466562|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1773466562 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1773466562 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-1773466562 |ULTIMATE.start_main_#t~ite18_Out-1773466562|)) (and (= ~y~0_In-1773466562 |ULTIMATE.start_main_#t~ite18_Out-1773466562|) .cse0 (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1773466562, ~y~0=~y~0_In-1773466562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1773466562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1773466562} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1773466562, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1773466562|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1773466562|, ~y~0=~y~0_In-1773466562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1773466562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1773466562} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 19:04:49,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-223741693 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-223741693 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-223741693| ~y$w_buff0_used~0_In-223741693) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-223741693| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-223741693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-223741693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-223741693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-223741693, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-223741693|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 19:04:49,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1349611245 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1349611245 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1349611245 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1349611245 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1349611245|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1349611245 |ULTIMATE.start_main_#t~ite21_Out-1349611245|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1349611245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1349611245, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1349611245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1349611245} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1349611245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1349611245, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1349611245|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1349611245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1349611245} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 19:04:49,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1091978949 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1091978949 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1091978949 |ULTIMATE.start_main_#t~ite22_Out-1091978949|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-1091978949| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1091978949, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1091978949} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1091978949, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1091978949, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1091978949|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 19:04:49,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In1774140912 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1774140912 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1774140912 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1774140912 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out1774140912| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out1774140912| ~y$r_buff1_thd0~0_In1774140912)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1774140912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1774140912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1774140912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1774140912} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1774140912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1774140912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1774140912, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1774140912|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1774140912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 19:04:49,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L820-->L820-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In974534996 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out974534996| |ULTIMATE.start_main_#t~ite29_Out974534996|) (= ~y$w_buff0~0_In974534996 |ULTIMATE.start_main_#t~ite29_Out974534996|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In974534996 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In974534996 256))) (and (= 0 (mod ~y$w_buff1_used~0_In974534996 256)) .cse1) (= (mod ~y$w_buff0_used~0_In974534996 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite30_Out974534996| ~y$w_buff0~0_In974534996) (= |ULTIMATE.start_main_#t~ite29_In974534996| |ULTIMATE.start_main_#t~ite29_Out974534996|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In974534996, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In974534996|, ~y$w_buff0~0=~y$w_buff0~0_In974534996, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In974534996, ~weak$$choice2~0=~weak$$choice2~0_In974534996, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974534996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974534996} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out974534996|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In974534996, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out974534996|, ~y$w_buff0~0=~y$w_buff0~0_In974534996, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In974534996, ~weak$$choice2~0=~weak$$choice2~0_In974534996, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974534996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974534996} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 19:04:49,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L821-->L821-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1998139306 256) 0))) (or (and (= ~y$w_buff1~0_In1998139306 |ULTIMATE.start_main_#t~ite33_Out1998139306|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In1998139306| |ULTIMATE.start_main_#t~ite32_Out1998139306|)) (and (= |ULTIMATE.start_main_#t~ite32_Out1998139306| ~y$w_buff1~0_In1998139306) (= |ULTIMATE.start_main_#t~ite32_Out1998139306| |ULTIMATE.start_main_#t~ite33_Out1998139306|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1998139306 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1998139306 256) 0)) (= (mod ~y$w_buff0_used~0_In1998139306 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In1998139306 256)) .cse1))) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1998139306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998139306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1998139306, ~weak$$choice2~0=~weak$$choice2~0_In1998139306, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1998139306, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In1998139306|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998139306} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1998139306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998139306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1998139306, ~weak$$choice2~0=~weak$$choice2~0_In1998139306, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1998139306|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1998139306, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1998139306|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998139306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 19:04:49,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1789215141 256)))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In-1789215141 |ULTIMATE.start_main_#t~ite36_Out-1789215141|) (= |ULTIMATE.start_main_#t~ite35_In-1789215141| |ULTIMATE.start_main_#t~ite35_Out-1789215141|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1789215141 256)))) (or (= (mod ~y$w_buff0_used~0_In-1789215141 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In-1789215141 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-1789215141 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite36_Out-1789215141| |ULTIMATE.start_main_#t~ite35_Out-1789215141|) .cse0 (= ~y$w_buff0_used~0_In-1789215141 |ULTIMATE.start_main_#t~ite35_Out-1789215141|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789215141, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1789215141, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1789215141|, ~weak$$choice2~0=~weak$$choice2~0_In-1789215141, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1789215141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1789215141} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789215141, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1789215141, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1789215141|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1789215141|, ~weak$$choice2~0=~weak$$choice2~0_In-1789215141, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1789215141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1789215141} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 19:04:49,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L824-->L825-8: Formula: (and (= v_~y$r_buff1_thd0~0_226 |v_ULTIMATE.start_main_#t~ite45_60|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= |v_ULTIMATE.start_main_#t~ite43_49| |v_ULTIMATE.start_main_#t~ite43_48|) (= |v_ULTIMATE.start_main_#t~ite44_49| |v_ULTIMATE.start_main_#t~ite44_48|) (= v_~y$r_buff0_thd0~0_339 v_~y$r_buff0_thd0~0_338)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_339, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_49|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_338, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 19:04:49,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_89 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_23) (not (= (mod v_~y$flush_delayed~0_24 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:04:49,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L830-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 19:04:49,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:04:49 BasicIcfg [2019-12-18 19:04:49,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:04:49,411 INFO L168 Benchmark]: Toolchain (without parser) took 17572.07 ms. Allocated memory was 136.8 MB in the beginning and 758.6 MB in the end (delta: 621.8 MB). Free memory was 98.9 MB in the beginning and 280.0 MB in the end (delta: -181.1 MB). Peak memory consumption was 440.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:49,412 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 19:04:49,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.31 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 98.5 MB in the beginning and 153.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:49,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.93 ms. Allocated memory is still 200.3 MB. Free memory was 153.3 MB in the beginning and 149.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:49,416 INFO L168 Benchmark]: Boogie Preprocessor took 39.59 ms. Allocated memory is still 200.3 MB. Free memory was 149.9 MB in the beginning and 147.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:49,416 INFO L168 Benchmark]: RCFGBuilder took 889.82 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 101.2 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:49,421 INFO L168 Benchmark]: TraceAbstraction took 15750.93 ms. Allocated memory was 200.3 MB in the beginning and 758.6 MB in the end (delta: 558.4 MB). Free memory was 101.2 MB in the beginning and 280.0 MB in the end (delta: -178.8 MB). Peak memory consumption was 379.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:49,429 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.50 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.31 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 98.5 MB in the beginning and 153.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.93 ms. Allocated memory is still 200.3 MB. Free memory was 153.3 MB in the beginning and 149.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.59 ms. Allocated memory is still 200.3 MB. Free memory was 149.9 MB in the beginning and 147.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 889.82 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 101.2 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15750.93 ms. Allocated memory was 200.3 MB in the beginning and 758.6 MB in the end (delta: 558.4 MB). Free memory was 101.2 MB in the beginning and 280.0 MB in the end (delta: -178.8 MB). Peak memory consumption was 379.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 161 ProgramPointsBefore, 81 ProgramPointsAfterwards, 192 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 4050 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 227 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 46210 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L775] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L746] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L820] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L821] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L822] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1214 SDtfs, 983 SDslu, 2874 SDs, 0 SdLazy, 1103 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21678occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 3256 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 93749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...