/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:03:25,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:03:25,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:03:25,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:03:25,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:03:25,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:03:25,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:03:25,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:03:25,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:03:25,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:03:25,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:03:25,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:03:25,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:03:25,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:03:25,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:03:25,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:03:25,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:03:25,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:03:25,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:03:25,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:03:25,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:03:25,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:03:25,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:03:25,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:03:25,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:03:25,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:03:25,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:03:25,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:03:25,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:03:25,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:03:25,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:03:25,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:03:25,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:03:25,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:03:25,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:03:25,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:03:25,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:03:25,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:03:25,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:03:25,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:03:25,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:03:25,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:03:25,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:03:25,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:03:25,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:03:25,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:03:25,572 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:03:25,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:03:25,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:03:25,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:03:25,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:03:25,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:03:25,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:03:25,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:03:25,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:03:25,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:03:25,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:03:25,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:03:25,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:03:25,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:03:25,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:03:25,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:03:25,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:03:25,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:03:25,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:03:25,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:03:25,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:03:25,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:03:25,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:03:25,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:03:25,577 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:03:25,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:03:25,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:03:25,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:03:25,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:03:25,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:03:25,905 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:03:25,906 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2019-12-18 13:03:25,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd62b9b28/020ba752694347fdb708e1e0587003b7/FLAG74d00145b [2019-12-18 13:03:26,552 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:03:26,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2019-12-18 13:03:26,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd62b9b28/020ba752694347fdb708e1e0587003b7/FLAG74d00145b [2019-12-18 13:03:26,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd62b9b28/020ba752694347fdb708e1e0587003b7 [2019-12-18 13:03:26,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:03:26,796 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:03:26,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:03:26,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:03:26,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:03:26,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:03:26" (1/1) ... [2019-12-18 13:03:26,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e5a994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:26, skipping insertion in model container [2019-12-18 13:03:26,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:03:26" (1/1) ... [2019-12-18 13:03:26,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:03:26,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:03:27,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:03:27,512 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:03:27,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:03:27,676 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:03:27,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27 WrapperNode [2019-12-18 13:03:27,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:03:27,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:03:27,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:03:27,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:03:27,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:03:27,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:03:27,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:03:27,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:03:27,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... [2019-12-18 13:03:27,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:03:27,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:03:27,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:03:27,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:03:27,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:03:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:03:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:03:27,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:03:27,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:03:27,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:03:27,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:03:27,848 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:03:27,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:03:27,848 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:03:27,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:03:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:03:27,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:03:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:03:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:03:27,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:03:27,851 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:03:28,590 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:03:28,591 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:03:28,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:03:28 BoogieIcfgContainer [2019-12-18 13:03:28,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:03:28,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:03:28,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:03:28,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:03:28,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:03:26" (1/3) ... [2019-12-18 13:03:28,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49048c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:03:28, skipping insertion in model container [2019-12-18 13:03:28,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:03:27" (2/3) ... [2019-12-18 13:03:28,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49048c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:03:28, skipping insertion in model container [2019-12-18 13:03:28,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:03:28" (3/3) ... [2019-12-18 13:03:28,602 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_rmo.opt.i [2019-12-18 13:03:28,613 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:03:28,613 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:03:28,621 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:03:28,622 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:03:28,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,682 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,682 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,727 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,727 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,734 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,744 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,744 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,758 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,759 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,799 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,806 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,806 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,806 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:03:28,823 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:03:28,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:03:28,844 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:03:28,844 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:03:28,844 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:03:28,844 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:03:28,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:03:28,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:03:28,844 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:03:28,861 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 13:03:28,863 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 13:03:28,957 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 13:03:28,957 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:03:28,976 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:03:29,003 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 13:03:29,075 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 13:03:29,075 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:03:29,084 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:03:29,107 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 13:03:29,108 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:03:34,842 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 13:03:34,993 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 13:03:35,045 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-18 13:03:35,045 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 13:03:35,050 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 13:04:13,699 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-18 13:04:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-18 13:04:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:04:13,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:13,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:13,708 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:13,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-18 13:04:13,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:13,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989055116] [2019-12-18 13:04:13,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:04:13,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989055116] [2019-12-18 13:04:13,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:13,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:04:13,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685846481] [2019-12-18 13:04:13,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:04:13,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:04:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:04:14,005 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-18 13:04:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:16,086 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-18 13:04:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:04:16,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:04:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:17,215 INFO L225 Difference]: With dead ends: 169554 [2019-12-18 13:04:17,215 INFO L226 Difference]: Without dead ends: 159076 [2019-12-18 13:04:17,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:04:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-18 13:04:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-18 13:04:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-18 13:04:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-18 13:04:42,014 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-18 13:04:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:42,015 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-18 13:04:42,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:04:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-18 13:04:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:04:42,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:42,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:42,033 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:42,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-18 13:04:42,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:42,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107364782] [2019-12-18 13:04:42,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:04:42,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107364782] [2019-12-18 13:04:42,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:42,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:04:42,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585803507] [2019-12-18 13:04:42,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:04:42,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:42,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:04:42,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:04:42,184 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-18 13:04:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:51,419 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-18 13:04:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:04:51,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:04:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:52,405 INFO L225 Difference]: With dead ends: 251868 [2019-12-18 13:04:52,405 INFO L226 Difference]: Without dead ends: 251658 [2019-12-18 13:04:52,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:04:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-18 13:05:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-18 13:05:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-18 13:05:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-18 13:05:16,785 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-18 13:05:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:16,786 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-18 13:05:16,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:05:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-18 13:05:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:05:16,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:16,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:16,791 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-18 13:05:16,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:16,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157060250] [2019-12-18 13:05:16,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:16,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 13:05:16,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157060250] [2019-12-18 13:05:16,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:16,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:16,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28602030] [2019-12-18 13:05:16,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:16,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:16,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:16,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:16,871 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-18 13:05:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:17,578 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-18 13:05:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:17,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:05:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:18,174 INFO L225 Difference]: With dead ends: 146539 [2019-12-18 13:05:18,175 INFO L226 Difference]: Without dead ends: 146539 [2019-12-18 13:05:18,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-18 13:05:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-18 13:05:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-18 13:05:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-18 13:05:35,750 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-18 13:05:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:35,751 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-18 13:05:35,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-18 13:05:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:05:35,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:35,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:35,757 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-18 13:05:35,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:35,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959450405] [2019-12-18 13:05:35,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:35,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959450405] [2019-12-18 13:05:35,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:35,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:35,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686476107] [2019-12-18 13:05:35,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:05:35,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:35,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:05:35,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:05:35,815 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 4 states. [2019-12-18 13:05:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:36,027 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-18 13:05:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:05:36,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:05:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:36,119 INFO L225 Difference]: With dead ends: 40251 [2019-12-18 13:05:36,119 INFO L226 Difference]: Without dead ends: 40251 [2019-12-18 13:05:36,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:05:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-18 13:05:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-18 13:05:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-18 13:05:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-18 13:05:42,009 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-18 13:05:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:42,009 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-18 13:05:42,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:05:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-18 13:05:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:05:42,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:42,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:42,012 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:42,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-18 13:05:42,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:42,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336742793] [2019-12-18 13:05:42,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:42,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336742793] [2019-12-18 13:05:42,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:42,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:42,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670360449] [2019-12-18 13:05:42,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:05:42,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:05:42,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:42,158 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 5 states. [2019-12-18 13:05:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:42,731 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-18 13:05:42,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:05:42,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:05:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:42,849 INFO L225 Difference]: With dead ends: 58215 [2019-12-18 13:05:42,850 INFO L226 Difference]: Without dead ends: 58197 [2019-12-18 13:05:42,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-18 13:05:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-18 13:05:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-18 13:05:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-18 13:05:44,522 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-18 13:05:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:44,523 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-18 13:05:44,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:05:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-18 13:05:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:05:44,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:44,543 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] [2019-12-18 13:05:44,543 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:44,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-18 13:05:44,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:44,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81305838] [2019-12-18 13:05:44,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:44,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81305838] [2019-12-18 13:05:44,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:44,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:05:44,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445433080] [2019-12-18 13:05:44,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:05:44,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:05:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:05:44,679 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 6 states. [2019-12-18 13:05:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:45,684 INFO L93 Difference]: Finished difference Result 73096 states and 253552 transitions. [2019-12-18 13:05:45,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:05:45,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:05:45,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:45,834 INFO L225 Difference]: With dead ends: 73096 [2019-12-18 13:05:45,834 INFO L226 Difference]: Without dead ends: 73066 [2019-12-18 13:05:45,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:05:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73066 states. [2019-12-18 13:05:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73066 to 50597. [2019-12-18 13:05:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50597 states. [2019-12-18 13:05:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50597 states to 50597 states and 178862 transitions. [2019-12-18 13:05:47,382 INFO L78 Accepts]: Start accepts. Automaton has 50597 states and 178862 transitions. Word has length 24 [2019-12-18 13:05:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:47,382 INFO L462 AbstractCegarLoop]: Abstraction has 50597 states and 178862 transitions. [2019-12-18 13:05:47,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:05:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 50597 states and 178862 transitions. [2019-12-18 13:05:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:05:47,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:47,397 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] [2019-12-18 13:05:47,398 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-18 13:05:47,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:47,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297312603] [2019-12-18 13:05:47,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:47,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297312603] [2019-12-18 13:05:47,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:47,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:05:47,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834710347] [2019-12-18 13:05:47,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:05:47,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:47,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:05:47,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:05:47,546 INFO L87 Difference]: Start difference. First operand 50597 states and 178862 transitions. Second operand 6 states. [2019-12-18 13:05:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:48,454 INFO L93 Difference]: Finished difference Result 73479 states and 253629 transitions. [2019-12-18 13:05:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:05:48,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:05:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:48,608 INFO L225 Difference]: With dead ends: 73479 [2019-12-18 13:05:48,609 INFO L226 Difference]: Without dead ends: 73449 [2019-12-18 13:05:48,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:05:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73449 states. [2019-12-18 13:05:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73449 to 48233. [2019-12-18 13:05:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48233 states. [2019-12-18 13:05:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48233 states to 48233 states and 170079 transitions. [2019-12-18 13:05:50,096 INFO L78 Accepts]: Start accepts. Automaton has 48233 states and 170079 transitions. Word has length 24 [2019-12-18 13:05:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:50,096 INFO L462 AbstractCegarLoop]: Abstraction has 48233 states and 170079 transitions. [2019-12-18 13:05:50,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:05:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 48233 states and 170079 transitions. [2019-12-18 13:05:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:05:50,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:50,122 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] [2019-12-18 13:05:50,123 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-18 13:05:50,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:50,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356882462] [2019-12-18 13:05:50,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:50,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356882462] [2019-12-18 13:05:50,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:50,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:05:50,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758296346] [2019-12-18 13:05:50,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:05:50,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:50,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:05:50,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:50,182 INFO L87 Difference]: Start difference. First operand 48233 states and 170079 transitions. Second operand 5 states. [2019-12-18 13:05:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:50,314 INFO L93 Difference]: Finished difference Result 26235 states and 93816 transitions. [2019-12-18 13:05:50,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:05:50,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:05:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:50,366 INFO L225 Difference]: With dead ends: 26235 [2019-12-18 13:05:50,366 INFO L226 Difference]: Without dead ends: 26235 [2019-12-18 13:05:50,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26235 states. [2019-12-18 13:05:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26235 to 25835. [2019-12-18 13:05:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-18 13:05:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 92456 transitions. [2019-12-18 13:05:51,260 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 92456 transitions. Word has length 28 [2019-12-18 13:05:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:51,260 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 92456 transitions. [2019-12-18 13:05:51,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:05:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 92456 transitions. [2019-12-18 13:05:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:05:51,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:51,308 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] [2019-12-18 13:05:51,308 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:51,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1812552662, now seen corresponding path program 1 times [2019-12-18 13:05:51,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:51,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012828971] [2019-12-18 13:05:51,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:51,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012828971] [2019-12-18 13:05:51,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:51,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:51,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905239139] [2019-12-18 13:05:51,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:05:51,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:05:51,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:05:51,387 INFO L87 Difference]: Start difference. First operand 25835 states and 92456 transitions. Second operand 4 states. [2019-12-18 13:05:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:51,624 INFO L93 Difference]: Finished difference Result 37412 states and 127885 transitions. [2019-12-18 13:05:51,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:05:51,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 13:05:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:51,698 INFO L225 Difference]: With dead ends: 37412 [2019-12-18 13:05:51,698 INFO L226 Difference]: Without dead ends: 26234 [2019-12-18 13:05:51,699 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 13:05:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26234 states. [2019-12-18 13:05:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26234 to 26084. [2019-12-18 13:05:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26084 states. [2019-12-18 13:05:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26084 states to 26084 states and 92286 transitions. [2019-12-18 13:05:52,192 INFO L78 Accepts]: Start accepts. Automaton has 26084 states and 92286 transitions. Word has length 42 [2019-12-18 13:05:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:52,192 INFO L462 AbstractCegarLoop]: Abstraction has 26084 states and 92286 transitions. [2019-12-18 13:05:52,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:05:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26084 states and 92286 transitions. [2019-12-18 13:05:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:05:52,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:52,228 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] [2019-12-18 13:05:52,228 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1574516846, now seen corresponding path program 2 times [2019-12-18 13:05:52,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:52,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8497308] [2019-12-18 13:05:52,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:52,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8497308] [2019-12-18 13:05:52,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:52,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:52,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953010437] [2019-12-18 13:05:52,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:52,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:52,300 INFO L87 Difference]: Start difference. First operand 26084 states and 92286 transitions. Second operand 3 states. [2019-12-18 13:05:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:52,436 INFO L93 Difference]: Finished difference Result 39452 states and 132645 transitions. [2019-12-18 13:05:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:52,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 13:05:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:52,483 INFO L225 Difference]: With dead ends: 39452 [2019-12-18 13:05:52,483 INFO L226 Difference]: Without dead ends: 26924 [2019-12-18 13:05:52,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26924 states. [2019-12-18 13:05:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26924 to 25835. [2019-12-18 13:05:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-18 13:05:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 79997 transitions. [2019-12-18 13:05:53,152 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 79997 transitions. Word has length 42 [2019-12-18 13:05:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:53,152 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 79997 transitions. [2019-12-18 13:05:53,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 79997 transitions. [2019-12-18 13:05:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 13:05:53,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:53,186 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] [2019-12-18 13:05:53,186 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-18 13:05:53,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:53,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781027907] [2019-12-18 13:05:53,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:53,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781027907] [2019-12-18 13:05:53,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:53,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:05:53,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679540578] [2019-12-18 13:05:53,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:05:53,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:05:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:05:53,250 INFO L87 Difference]: Start difference. First operand 25835 states and 79997 transitions. Second operand 6 states. [2019-12-18 13:05:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:53,406 INFO L93 Difference]: Finished difference Result 24507 states and 76659 transitions. [2019-12-18 13:05:53,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:05:53,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 13:05:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:53,428 INFO L225 Difference]: With dead ends: 24507 [2019-12-18 13:05:53,428 INFO L226 Difference]: Without dead ends: 10719 [2019-12-18 13:05:53,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:05:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10719 states. [2019-12-18 13:05:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10719 to 10341. [2019-12-18 13:05:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10341 states. [2019-12-18 13:05:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10341 states to 10341 states and 32248 transitions. [2019-12-18 13:05:53,620 INFO L78 Accepts]: Start accepts. Automaton has 10341 states and 32248 transitions. Word has length 43 [2019-12-18 13:05:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:53,620 INFO L462 AbstractCegarLoop]: Abstraction has 10341 states and 32248 transitions. [2019-12-18 13:05:53,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:05:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 10341 states and 32248 transitions. [2019-12-18 13:05:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:53,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:53,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:53,635 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash -360004126, now seen corresponding path program 1 times [2019-12-18 13:05:53,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:53,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009060035] [2019-12-18 13:05:53,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:53,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009060035] [2019-12-18 13:05:53,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:53,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:53,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085408571] [2019-12-18 13:05:53,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:53,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:53,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:53,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:53,696 INFO L87 Difference]: Start difference. First operand 10341 states and 32248 transitions. Second operand 3 states. [2019-12-18 13:05:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:53,786 INFO L93 Difference]: Finished difference Result 13894 states and 42635 transitions. [2019-12-18 13:05:53,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:53,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 13:05:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:53,810 INFO L225 Difference]: With dead ends: 13894 [2019-12-18 13:05:53,811 INFO L226 Difference]: Without dead ends: 13894 [2019-12-18 13:05:53,811 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 13:05:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13894 states. [2019-12-18 13:05:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13894 to 11246. [2019-12-18 13:05:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11246 states. [2019-12-18 13:05:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 35029 transitions. [2019-12-18 13:05:54,010 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 35029 transitions. Word has length 57 [2019-12-18 13:05:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:54,010 INFO L462 AbstractCegarLoop]: Abstraction has 11246 states and 35029 transitions. [2019-12-18 13:05:54,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 35029 transitions. [2019-12-18 13:05:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:54,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:54,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:54,023 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1774753707, now seen corresponding path program 1 times [2019-12-18 13:05:54,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:54,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845970688] [2019-12-18 13:05:54,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:54,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845970688] [2019-12-18 13:05:54,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:54,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:05:54,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297204619] [2019-12-18 13:05:54,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:05:54,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:05:54,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:54,122 INFO L87 Difference]: Start difference. First operand 11246 states and 35029 transitions. Second operand 7 states. [2019-12-18 13:05:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:54,540 INFO L93 Difference]: Finished difference Result 31203 states and 96822 transitions. [2019-12-18 13:05:54,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:05:54,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 13:05:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:54,589 INFO L225 Difference]: With dead ends: 31203 [2019-12-18 13:05:54,589 INFO L226 Difference]: Without dead ends: 24459 [2019-12-18 13:05:54,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:05:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24459 states. [2019-12-18 13:05:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24459 to 14347. [2019-12-18 13:05:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-18 13:05:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 45043 transitions. [2019-12-18 13:05:54,924 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 45043 transitions. Word has length 57 [2019-12-18 13:05:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:54,925 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 45043 transitions. [2019-12-18 13:05:54,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:05:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 45043 transitions. [2019-12-18 13:05:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:54,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:54,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:54,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash -70014025, now seen corresponding path program 2 times [2019-12-18 13:05:54,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:54,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746580847] [2019-12-18 13:05:54,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:55,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746580847] [2019-12-18 13:05:55,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:55,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:05:55,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833012416] [2019-12-18 13:05:55,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:05:55,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:55,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:05:55,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:05:55,135 INFO L87 Difference]: Start difference. First operand 14347 states and 45043 transitions. Second operand 6 states. [2019-12-18 13:05:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:55,478 INFO L93 Difference]: Finished difference Result 36806 states and 112743 transitions. [2019-12-18 13:05:55,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:05:55,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 13:05:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:55,518 INFO L225 Difference]: With dead ends: 36806 [2019-12-18 13:05:55,518 INFO L226 Difference]: Without dead ends: 26675 [2019-12-18 13:05:55,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:05:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26675 states. [2019-12-18 13:05:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26675 to 16874. [2019-12-18 13:05:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16874 states. [2019-12-18 13:05:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16874 states to 16874 states and 52931 transitions. [2019-12-18 13:05:55,864 INFO L78 Accepts]: Start accepts. Automaton has 16874 states and 52931 transitions. Word has length 57 [2019-12-18 13:05:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:55,864 INFO L462 AbstractCegarLoop]: Abstraction has 16874 states and 52931 transitions. [2019-12-18 13:05:55,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:05:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 16874 states and 52931 transitions. [2019-12-18 13:05:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:55,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:55,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:55,883 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash -766414125, now seen corresponding path program 3 times [2019-12-18 13:05:55,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:55,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864845730] [2019-12-18 13:05:55,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:55,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864845730] [2019-12-18 13:05:55,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:55,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:05:55,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144754699] [2019-12-18 13:05:55,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:05:55,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:05:55,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:55,982 INFO L87 Difference]: Start difference. First operand 16874 states and 52931 transitions. Second operand 7 states. [2019-12-18 13:05:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:56,343 INFO L93 Difference]: Finished difference Result 29867 states and 90934 transitions. [2019-12-18 13:05:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:05:56,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 13:05:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:56,383 INFO L225 Difference]: With dead ends: 29867 [2019-12-18 13:05:56,383 INFO L226 Difference]: Without dead ends: 27808 [2019-12-18 13:05:56,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:05:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27808 states. [2019-12-18 13:05:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27808 to 16938. [2019-12-18 13:05:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 13:05:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 53162 transitions. [2019-12-18 13:05:56,736 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 53162 transitions. Word has length 57 [2019-12-18 13:05:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:56,736 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 53162 transitions. [2019-12-18 13:05:56,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:05:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 53162 transitions. [2019-12-18 13:05:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:56,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:56,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:56,756 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1761143536, now seen corresponding path program 1 times [2019-12-18 13:05:56,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:56,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296685045] [2019-12-18 13:05:56,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:56,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296685045] [2019-12-18 13:05:56,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:56,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:56,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790590508] [2019-12-18 13:05:56,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:56,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:56,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:56,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:56,806 INFO L87 Difference]: Start difference. First operand 16938 states and 53162 transitions. Second operand 3 states. [2019-12-18 13:05:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:56,906 INFO L93 Difference]: Finished difference Result 18741 states and 57074 transitions. [2019-12-18 13:05:56,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:56,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 13:05:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:56,941 INFO L225 Difference]: With dead ends: 18741 [2019-12-18 13:05:56,941 INFO L226 Difference]: Without dead ends: 18741 [2019-12-18 13:05:56,941 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 13:05:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18741 states. [2019-12-18 13:05:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18741 to 16938. [2019-12-18 13:05:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 13:05:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51972 transitions. [2019-12-18 13:05:57,364 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51972 transitions. Word has length 57 [2019-12-18 13:05:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:57,364 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51972 transitions. [2019-12-18 13:05:57,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51972 transitions. [2019-12-18 13:05:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:57,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:57,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:57,383 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:57,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1904135869, now seen corresponding path program 4 times [2019-12-18 13:05:57,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:57,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438365197] [2019-12-18 13:05:57,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:57,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438365197] [2019-12-18 13:05:57,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:57,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:05:57,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732618412] [2019-12-18 13:05:57,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:05:57,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:05:57,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:57,457 INFO L87 Difference]: Start difference. First operand 16938 states and 51972 transitions. Second operand 7 states. [2019-12-18 13:05:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:57,839 INFO L93 Difference]: Finished difference Result 33067 states and 98644 transitions. [2019-12-18 13:05:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:05:57,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 13:05:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:57,876 INFO L225 Difference]: With dead ends: 33067 [2019-12-18 13:05:57,877 INFO L226 Difference]: Without dead ends: 27923 [2019-12-18 13:05:57,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:05:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27923 states. [2019-12-18 13:05:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27923 to 17148. [2019-12-18 13:05:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17148 states. [2019-12-18 13:05:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17148 states to 17148 states and 52559 transitions. [2019-12-18 13:05:58,214 INFO L78 Accepts]: Start accepts. Automaton has 17148 states and 52559 transitions. Word has length 57 [2019-12-18 13:05:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:58,214 INFO L462 AbstractCegarLoop]: Abstraction has 17148 states and 52559 transitions. [2019-12-18 13:05:58,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:05:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17148 states and 52559 transitions. [2019-12-18 13:05:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:58,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:58,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:58,233 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash -576788017, now seen corresponding path program 5 times [2019-12-18 13:05:58,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:58,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207882610] [2019-12-18 13:05:58,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:58,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207882610] [2019-12-18 13:05:58,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:58,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:05:58,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076504985] [2019-12-18 13:05:58,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:05:58,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:58,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:05:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:58,319 INFO L87 Difference]: Start difference. First operand 17148 states and 52559 transitions. Second operand 5 states. [2019-12-18 13:05:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:58,790 INFO L93 Difference]: Finished difference Result 26314 states and 78268 transitions. [2019-12-18 13:05:58,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:05:58,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 13:05:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:58,827 INFO L225 Difference]: With dead ends: 26314 [2019-12-18 13:05:58,827 INFO L226 Difference]: Without dead ends: 26188 [2019-12-18 13:05:58,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26188 states. [2019-12-18 13:05:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26188 to 20073. [2019-12-18 13:05:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20073 states. [2019-12-18 13:05:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 61009 transitions. [2019-12-18 13:05:59,351 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 61009 transitions. Word has length 57 [2019-12-18 13:05:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:59,352 INFO L462 AbstractCegarLoop]: Abstraction has 20073 states and 61009 transitions. [2019-12-18 13:05:59,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:05:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 61009 transitions. [2019-12-18 13:05:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:59,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:59,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:59,373 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1952605815, now seen corresponding path program 6 times [2019-12-18 13:05:59,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:59,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667909869] [2019-12-18 13:05:59,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:05:59,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667909869] [2019-12-18 13:05:59,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:59,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:05:59,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227056817] [2019-12-18 13:05:59,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:05:59,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:05:59,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:05:59,500 INFO L87 Difference]: Start difference. First operand 20073 states and 61009 transitions. Second operand 8 states. [2019-12-18 13:06:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:00,612 INFO L93 Difference]: Finished difference Result 27381 states and 81339 transitions. [2019-12-18 13:06:00,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:06:00,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 13:06:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:00,648 INFO L225 Difference]: With dead ends: 27381 [2019-12-18 13:06:00,648 INFO L226 Difference]: Without dead ends: 27381 [2019-12-18 13:06:00,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:06:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27381 states. [2019-12-18 13:06:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27381 to 20271. [2019-12-18 13:06:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20271 states. [2019-12-18 13:06:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20271 states to 20271 states and 61591 transitions. [2019-12-18 13:06:01,003 INFO L78 Accepts]: Start accepts. Automaton has 20271 states and 61591 transitions. Word has length 57 [2019-12-18 13:06:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:01,004 INFO L462 AbstractCegarLoop]: Abstraction has 20271 states and 61591 transitions. [2019-12-18 13:06:01,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:06:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 20271 states and 61591 transitions. [2019-12-18 13:06:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:06:01,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:01,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:01,026 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2126429955, now seen corresponding path program 7 times [2019-12-18 13:06:01,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:01,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813756228] [2019-12-18 13:06:01,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:01,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813756228] [2019-12-18 13:06:01,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:01,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:06:01,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546252597] [2019-12-18 13:06:01,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:06:01,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:06:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:06:01,173 INFO L87 Difference]: Start difference. First operand 20271 states and 61591 transitions. Second operand 9 states. [2019-12-18 13:06:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:02,334 INFO L93 Difference]: Finished difference Result 29033 states and 85853 transitions. [2019-12-18 13:06:02,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:06:02,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 13:06:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:02,375 INFO L225 Difference]: With dead ends: 29033 [2019-12-18 13:06:02,375 INFO L226 Difference]: Without dead ends: 29033 [2019-12-18 13:06:02,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:06:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29033 states. [2019-12-18 13:06:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29033 to 23020. [2019-12-18 13:06:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23020 states. [2019-12-18 13:06:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23020 states to 23020 states and 69387 transitions. [2019-12-18 13:06:02,902 INFO L78 Accepts]: Start accepts. Automaton has 23020 states and 69387 transitions. Word has length 57 [2019-12-18 13:06:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:02,902 INFO L462 AbstractCegarLoop]: Abstraction has 23020 states and 69387 transitions. [2019-12-18 13:06:02,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:06:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 23020 states and 69387 transitions. [2019-12-18 13:06:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:06:02,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:02,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:02,928 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1809878711, now seen corresponding path program 8 times [2019-12-18 13:06:02,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:02,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207528312] [2019-12-18 13:06:02,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:03,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207528312] [2019-12-18 13:06:03,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:03,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:06:03,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928060237] [2019-12-18 13:06:03,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:06:03,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:06:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:06:03,103 INFO L87 Difference]: Start difference. First operand 23020 states and 69387 transitions. Second operand 10 states. [2019-12-18 13:06:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:04,671 INFO L93 Difference]: Finished difference Result 35444 states and 103738 transitions. [2019-12-18 13:06:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:06:04,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-18 13:06:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:04,726 INFO L225 Difference]: With dead ends: 35444 [2019-12-18 13:06:04,727 INFO L226 Difference]: Without dead ends: 35156 [2019-12-18 13:06:04,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:06:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35156 states. [2019-12-18 13:06:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35156 to 25598. [2019-12-18 13:06:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25598 states. [2019-12-18 13:06:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25598 states to 25598 states and 76158 transitions. [2019-12-18 13:06:05,237 INFO L78 Accepts]: Start accepts. Automaton has 25598 states and 76158 transitions. Word has length 57 [2019-12-18 13:06:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:05,238 INFO L462 AbstractCegarLoop]: Abstraction has 25598 states and 76158 transitions. [2019-12-18 13:06:05,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:06:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 25598 states and 76158 transitions. [2019-12-18 13:06:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:06:05,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:05,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:05,264 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524261, now seen corresponding path program 9 times [2019-12-18 13:06:05,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:05,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570803432] [2019-12-18 13:06:05,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:05,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570803432] [2019-12-18 13:06:05,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:05,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:06:05,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470831722] [2019-12-18 13:06:05,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:06:05,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:05,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:06:05,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:06:05,417 INFO L87 Difference]: Start difference. First operand 25598 states and 76158 transitions. Second operand 10 states. [2019-12-18 13:06:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:07,252 INFO L93 Difference]: Finished difference Result 43300 states and 126781 transitions. [2019-12-18 13:06:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:06:07,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-18 13:06:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:07,312 INFO L225 Difference]: With dead ends: 43300 [2019-12-18 13:06:07,312 INFO L226 Difference]: Without dead ends: 43111 [2019-12-18 13:06:07,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:06:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43111 states. [2019-12-18 13:06:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43111 to 26559. [2019-12-18 13:06:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26559 states. [2019-12-18 13:06:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26559 states to 26559 states and 79086 transitions. [2019-12-18 13:06:07,822 INFO L78 Accepts]: Start accepts. Automaton has 26559 states and 79086 transitions. Word has length 57 [2019-12-18 13:06:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:07,822 INFO L462 AbstractCegarLoop]: Abstraction has 26559 states and 79086 transitions. [2019-12-18 13:06:07,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:06:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 26559 states and 79086 transitions. [2019-12-18 13:06:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:06:07,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:07,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:07,851 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash 99843907, now seen corresponding path program 10 times [2019-12-18 13:06:07,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:07,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379945326] [2019-12-18 13:06:07,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:07,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379945326] [2019-12-18 13:06:07,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:07,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:06:07,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192744384] [2019-12-18 13:06:07,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:07,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:07,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:07,927 INFO L87 Difference]: Start difference. First operand 26559 states and 79086 transitions. Second operand 3 states. [2019-12-18 13:06:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:08,033 INFO L93 Difference]: Finished difference Result 26559 states and 79084 transitions. [2019-12-18 13:06:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:08,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 13:06:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:08,081 INFO L225 Difference]: With dead ends: 26559 [2019-12-18 13:06:08,082 INFO L226 Difference]: Without dead ends: 26559 [2019-12-18 13:06:08,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26559 states. [2019-12-18 13:06:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26559 to 21410. [2019-12-18 13:06:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-18 13:06:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 64958 transitions. [2019-12-18 13:06:08,617 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 64958 transitions. Word has length 57 [2019-12-18 13:06:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:08,618 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 64958 transitions. [2019-12-18 13:06:08,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 64958 transitions. [2019-12-18 13:06:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:06:08,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:08,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:08,642 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1231350538, now seen corresponding path program 1 times [2019-12-18 13:06:08,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:08,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266550520] [2019-12-18 13:06:08,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:06:08,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266550520] [2019-12-18 13:06:08,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:08,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:06:08,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22806049] [2019-12-18 13:06:08,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:08,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:08,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:08,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:08,691 INFO L87 Difference]: Start difference. First operand 21410 states and 64958 transitions. Second operand 3 states. [2019-12-18 13:06:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:08,758 INFO L93 Difference]: Finished difference Result 15546 states and 46539 transitions. [2019-12-18 13:06:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:08,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:06:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:08,788 INFO L225 Difference]: With dead ends: 15546 [2019-12-18 13:06:08,789 INFO L226 Difference]: Without dead ends: 15546 [2019-12-18 13:06:08,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15546 states. [2019-12-18 13:06:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15546 to 14958. [2019-12-18 13:06:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14958 states. [2019-12-18 13:06:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14958 states to 14958 states and 44764 transitions. [2019-12-18 13:06:09,042 INFO L78 Accepts]: Start accepts. Automaton has 14958 states and 44764 transitions. Word has length 58 [2019-12-18 13:06:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:09,042 INFO L462 AbstractCegarLoop]: Abstraction has 14958 states and 44764 transitions. [2019-12-18 13:06:09,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14958 states and 44764 transitions. [2019-12-18 13:06:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:06:09,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:09,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:06:09,059 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:09,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 1 times [2019-12-18 13:06:09,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:09,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596004484] [2019-12-18 13:06:09,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:06:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:06:09,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:06:09,177 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:06:09,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t733~0.base_21| 1)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t733~0.base_21|) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t733~0.base_21|)) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t733~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t733~0.base_21|) |v_ULTIMATE.start_main_~#t733~0.offset_16| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 |v_ULTIMATE.start_main_~#t733~0.offset_16|) (= 0 v_~y$r_buff1_thd2~0_255) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t733~0.base_21| 4)) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, ULTIMATE.start_main_~#t733~0.base=|v_ULTIMATE.start_main_~#t733~0.base_21|, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ULTIMATE.start_main_~#t733~0.offset=|v_ULTIMATE.start_main_~#t733~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t736~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t736~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t735~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t735~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t734~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t733~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t733~0.offset, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:06:09,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t734~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t734~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10|) |v_ULTIMATE.start_main_~#t734~0.offset_10| 1)) |v_#memory_int_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t734~0.base_10| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t734~0.base_10| 4)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_~#t734~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 13:06:09,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t735~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t735~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11|) |v_ULTIMATE.start_main_~#t735~0.offset_10| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t735~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t735~0.base_11| 4)) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t735~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t735~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 13:06:09,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:06:09,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t736~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t736~0.offset_10|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t736~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t736~0.base_11| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11|) |v_ULTIMATE.start_main_~#t736~0.offset_10| 3)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t736~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t736~0.offset] because there is no mapped edge [2019-12-18 13:06:09,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out-225904644| |P3Thread1of1ForFork0_#t~ite33_Out-225904644|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-225904644 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-225904644 256)))) (or (and .cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out-225904644| ~y~0_In-225904644) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out-225904644| ~y$w_buff1~0_In-225904644)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-225904644, ~y$w_buff1~0=~y$w_buff1~0_In-225904644, ~y~0=~y~0_In-225904644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-225904644} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-225904644, ~y$w_buff1~0=~y$w_buff1~0_In-225904644, ~y~0=~y~0_In-225904644, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-225904644|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-225904644|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-225904644} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 13:06:09,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, 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_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 13:06:09,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1123870038 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1123870038 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1123870038|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out1123870038| ~y$w_buff0_used~0_In1123870038)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1123870038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1123870038} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1123870038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1123870038, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1123870038|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 13:06:09,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In918156502 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In918156502 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In918156502 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In918156502 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out918156502|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In918156502 |P3Thread1of1ForFork0_#t~ite35_Out918156502|) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In918156502, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In918156502, ~y$w_buff0_used~0=~y$w_buff0_used~0_In918156502, ~y$w_buff1_used~0=~y$w_buff1_used~0_In918156502} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In918156502, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In918156502, ~y$w_buff0_used~0=~y$w_buff0_used~0_In918156502, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out918156502|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In918156502} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 13:06:09,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In-1052017993 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1052017993 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1052017993|)) (and (= ~y$r_buff0_thd4~0_In-1052017993 |P3Thread1of1ForFork0_#t~ite36_Out-1052017993|) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1052017993, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1052017993} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1052017993, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1052017993, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1052017993|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 13:06:09,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd4~0_In-1700731806 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1700731806 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1700731806 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1700731806 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out-1700731806| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-1700731806| ~y$r_buff1_thd4~0_In-1700731806) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1700731806, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1700731806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700731806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1700731806} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1700731806, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1700731806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700731806, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1700731806|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1700731806} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 13:06:09,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_42| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_41|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:06:09,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1673804593 256)))) (or (and (= ~y$w_buff1~0_In1673804593 |P1Thread1of1ForFork2_#t~ite12_Out1673804593|) (= |P1Thread1of1ForFork2_#t~ite11_In1673804593| |P1Thread1of1ForFork2_#t~ite11_Out1673804593|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1673804593 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1673804593 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1673804593 256))) (and (= (mod ~y$r_buff1_thd2~0_In1673804593 256) 0) .cse1))) .cse0 (= ~y$w_buff1~0_In1673804593 |P1Thread1of1ForFork2_#t~ite11_Out1673804593|) (= |P1Thread1of1ForFork2_#t~ite11_Out1673804593| |P1Thread1of1ForFork2_#t~ite12_Out1673804593|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1673804593, ~y$w_buff1~0=~y$w_buff1~0_In1673804593, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1673804593, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1673804593, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1673804593|, ~weak$$choice2~0=~weak$$choice2~0_In1673804593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1673804593} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1673804593, ~y$w_buff1~0=~y$w_buff1~0_In1673804593, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1673804593, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1673804593, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1673804593|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1673804593|, ~weak$$choice2~0=~weak$$choice2~0_In1673804593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1673804593} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:06:09,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-803184434 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_In-803184434| |P1Thread1of1ForFork2_#t~ite14_Out-803184434|) (= ~y$w_buff0_used~0_In-803184434 |P1Thread1of1ForFork2_#t~ite15_Out-803184434|) (not .cse0)) (and (= ~y$w_buff0_used~0_In-803184434 |P1Thread1of1ForFork2_#t~ite14_Out-803184434|) (= |P1Thread1of1ForFork2_#t~ite14_Out-803184434| |P1Thread1of1ForFork2_#t~ite15_Out-803184434|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-803184434 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-803184434 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-803184434 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-803184434 256) 0)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-803184434, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-803184434, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-803184434, ~weak$$choice2~0=~weak$$choice2~0_In-803184434, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-803184434|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-803184434} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-803184434, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-803184434, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-803184434, ~weak$$choice2~0=~weak$$choice2~0_In-803184434, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-803184434|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-803184434|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-803184434} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 13:06:09,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 13:06:09,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1411570558 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out1411570558| ~y$r_buff1_thd2~0_In1411570558) (= |P1Thread1of1ForFork2_#t~ite23_In1411570558| |P1Thread1of1ForFork2_#t~ite23_Out1411570558|)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out1411570558| |P1Thread1of1ForFork2_#t~ite24_Out1411570558|) (= |P1Thread1of1ForFork2_#t~ite23_Out1411570558| ~y$r_buff1_thd2~0_In1411570558) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1411570558 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1411570558 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1411570558 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1411570558 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1411570558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1411570558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1411570558, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1411570558|, ~weak$$choice2~0=~weak$$choice2~0_In1411570558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1411570558} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1411570558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1411570558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1411570558, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1411570558|, ~weak$$choice2~0=~weak$$choice2~0_In1411570558, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1411570558|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1411570558} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 13:06:09,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 13:06:09,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1965061294 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1965061294 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1965061294 |P2Thread1of1ForFork3_#t~ite28_Out1965061294|)) (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out1965061294|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1965061294, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1965061294} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1965061294, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1965061294, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1965061294|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 13:06:09,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1238384349 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1238384349 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1238384349 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1238384349 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1238384349| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1238384349| ~y$w_buff1_used~0_In-1238384349) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1238384349, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238384349, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1238384349, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238384349} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1238384349, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238384349, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1238384349, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1238384349|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238384349} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 13:06:09,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-999107490 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-999107490 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-999107490 ~y$r_buff0_thd3~0_In-999107490) (or .cse0 .cse1)) (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-999107490 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-999107490, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-999107490} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-999107490|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-999107490, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-999107490} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:06:09,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In184529371 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In184529371 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In184529371 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In184529371 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out184529371| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork3_#t~ite31_Out184529371| ~y$r_buff1_thd3~0_In184529371)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In184529371, ~y$w_buff0_used~0=~y$w_buff0_used~0_In184529371, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In184529371, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184529371} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In184529371, ~y$w_buff0_used~0=~y$w_buff0_used~0_In184529371, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In184529371, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out184529371|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184529371} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 13:06:09,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_60)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:06:09,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_30) (= v_~main$tmp_guard0~0_10 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:06:09,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-1364071661| |ULTIMATE.start_main_#t~ite43_Out-1364071661|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1364071661 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1364071661 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite42_Out-1364071661| ~y~0_In-1364071661)) (and .cse2 (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1364071661| ~y$w_buff1~0_In-1364071661) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1364071661, ~y~0=~y~0_In-1364071661, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1364071661, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1364071661} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1364071661, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1364071661|, ~y~0=~y~0_In-1364071661, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1364071661|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1364071661, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1364071661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:06:09,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1691445845 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1691445845 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1691445845| ~y$w_buff0_used~0_In1691445845)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1691445845|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1691445845, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1691445845} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1691445845, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1691445845, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1691445845|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:06:09,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1447291077 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1447291077 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1447291077 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1447291077 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1447291077| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1447291077| ~y$w_buff1_used~0_In-1447291077)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1447291077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1447291077, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1447291077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1447291077} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1447291077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1447291077, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1447291077, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1447291077|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1447291077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:06:09,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1094414249 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1094414249 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1094414249| ~y$r_buff0_thd0~0_In-1094414249) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1094414249| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1094414249, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1094414249} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1094414249, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1094414249, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1094414249|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 13:06:09,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1330212068 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1330212068 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1330212068 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1330212068 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out1330212068|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1330212068 |ULTIMATE.start_main_#t~ite47_Out1330212068|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1330212068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1330212068, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1330212068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1330212068} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1330212068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1330212068, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1330212068|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1330212068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1330212068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 13:06:09,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= v_~x~0_41 2) (= v_~main$tmp_guard1~0_23 0) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:06:09,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:06:09 BasicIcfg [2019-12-18 13:06:09,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:06:09,329 INFO L168 Benchmark]: Toolchain (without parser) took 162533.21 ms. Allocated memory was 134.2 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 97.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 13:06:09,330 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 117.4 MB in the beginning and 117.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:06:09,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.37 ms. Allocated memory was 134.2 MB in the beginning and 198.2 MB in the end (delta: 64.0 MB). Free memory was 97.0 MB in the beginning and 151.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:06:09,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.30 ms. Allocated memory is still 198.2 MB. Free memory was 151.7 MB in the beginning and 148.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:06:09,335 INFO L168 Benchmark]: Boogie Preprocessor took 43.00 ms. Allocated memory is still 198.2 MB. Free memory was 148.7 MB in the beginning and 146.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:06:09,338 INFO L168 Benchmark]: RCFGBuilder took 807.93 ms. Allocated memory is still 198.2 MB. Free memory was 146.6 MB in the beginning and 97.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:06:09,339 INFO L168 Benchmark]: TraceAbstraction took 160733.18 ms. Allocated memory was 198.2 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 13:06:09,344 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 117.4 MB in the beginning and 117.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 880.37 ms. Allocated memory was 134.2 MB in the beginning and 198.2 MB in the end (delta: 64.0 MB). Free memory was 97.0 MB in the beginning and 151.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.30 ms. Allocated memory is still 198.2 MB. Free memory was 151.7 MB in the beginning and 148.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.00 ms. Allocated memory is still 198.2 MB. Free memory was 148.7 MB in the beginning and 146.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 807.93 ms. Allocated memory is still 198.2 MB. Free memory was 146.6 MB in the beginning and 97.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 160733.18 ms. Allocated memory was 198.2 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t733, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L843] FCALL, FORK 0 pthread_create(&t734, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L845] FCALL, FORK 0 pthread_create(&t735, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t736, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] 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=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 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) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 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 [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 160.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4677 SDtfs, 5237 SDslu, 11907 SDs, 0 SdLazy, 7011 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 44 SyntacticMatches, 20 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred 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: 84.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 174918 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1073 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 990 ConstructedInterpolants, 0 QuantifiedInterpolants, 184120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...