/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/mix041_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:31:04,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:31:04,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:31:04,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:31:04,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:31:04,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:31:04,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:31:04,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:31:04,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:31:04,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:31:04,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:31:04,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:31:04,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:31:04,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:31:04,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:31:04,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:31:04,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:31:04,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:31:04,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:31:04,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:31:04,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:31:04,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:31:04,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:31:04,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:31:04,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:31:04,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:31:04,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:31:04,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:31:04,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:31:04,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:31:04,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:31:04,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:31:04,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:31:04,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:31:04,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:31:04,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:31:04,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:31:04,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:31:04,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:31:04,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:31:04,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:31:04,656 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:31:04,672 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:31:04,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:31:04,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:31:04,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:31:04,674 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:31:04,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:31:04,675 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:31:04,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:31:04,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:31:04,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:31:04,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:31:04,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:31:04,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:31:04,676 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:31:04,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:31:04,676 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:31:04,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:31:04,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:31:04,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:31:04,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:31:04,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:31:04,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:31:04,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:31:04,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:31:04,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:31:04,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:31:04,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:31:04,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:31:04,679 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:31:04,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:31:04,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:31:04,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:31:04,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:31:04,983 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:31:04,984 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:31:04,985 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.oepc.i [2019-12-18 13:31:05,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f218bd3/a4987d61767d47598355702c49206469/FLAG9d1756c02 [2019-12-18 13:31:05,625 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:31:05,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_tso.oepc.i [2019-12-18 13:31:05,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f218bd3/a4987d61767d47598355702c49206469/FLAG9d1756c02 [2019-12-18 13:31:05,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f218bd3/a4987d61767d47598355702c49206469 [2019-12-18 13:31:05,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:31:05,907 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:31:05,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:05,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:31:05,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:31:05,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:05" (1/1) ... [2019-12-18 13:31:05,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116f9d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:05, skipping insertion in model container [2019-12-18 13:31:05,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:05" (1/1) ... [2019-12-18 13:31:05,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:31:05,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:31:06,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:06,555 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:31:06,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:06,696 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:31:06,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06 WrapperNode [2019-12-18 13:31:06,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:06,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:06,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:31:06,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:31:06,707 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:31:06" (1/1) ... [2019-12-18 13:31:06,727 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:31:06" (1/1) ... [2019-12-18 13:31:06,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:06,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:31:06,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:31:06,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:31:06,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (1/1) ... [2019-12-18 13:31:06,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (1/1) ... [2019-12-18 13:31:06,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (1/1) ... [2019-12-18 13:31:06,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (1/1) ... [2019-12-18 13:31:06,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (1/1) ... [2019-12-18 13:31:06,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (1/1) ... [2019-12-18 13:31:06,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (1/1) ... [2019-12-18 13:31:06,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:31:06,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:31:06,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:31:06,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:31:06,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:31:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:31:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:31:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:31:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:31:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:31:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:31:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:31:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:31:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:31:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:31:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:31:06,876 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:31:07,579 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:31:07,580 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:31:07,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:07 BoogieIcfgContainer [2019-12-18 13:31:07,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:31:07,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:31:07,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:31:07,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:31:07,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:31:05" (1/3) ... [2019-12-18 13:31:07,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315f4d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:07, skipping insertion in model container [2019-12-18 13:31:07,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:06" (2/3) ... [2019-12-18 13:31:07,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315f4d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:07, skipping insertion in model container [2019-12-18 13:31:07,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:07" (3/3) ... [2019-12-18 13:31:07,591 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_tso.oepc.i [2019-12-18 13:31:07,602 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:31:07,603 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:31:07,611 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:31:07,612 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:31:07,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,658 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:07,712 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:31:07,728 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:31:07,728 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:31:07,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:31:07,728 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:31:07,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:31:07,729 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:31:07,729 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:31:07,729 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:31:07,749 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 13:31:07,751 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 13:31:07,864 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 13:31:07,864 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:07,878 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:31:07,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 13:31:07,943 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 13:31:07,943 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:07,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:31:07,973 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 13:31:07,975 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:31:12,179 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 13:31:12,289 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:31:12,321 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45620 [2019-12-18 13:31:12,321 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 13:31:12,325 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-18 13:31:12,791 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8218 states. [2019-12-18 13:31:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states. [2019-12-18 13:31:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 13:31:12,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:12,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 13:31:12,801 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash 699456563, now seen corresponding path program 1 times [2019-12-18 13:31:12,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:12,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603198687] [2019-12-18 13:31:12,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:13,033 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:31:13,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603198687] [2019-12-18 13:31:13,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:13,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:31:13,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577855348] [2019-12-18 13:31:13,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:13,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:13,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:13,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:13,054 INFO L87 Difference]: Start difference. First operand 8218 states. Second operand 3 states. [2019-12-18 13:31:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:13,311 INFO L93 Difference]: Finished difference Result 8170 states and 26597 transitions. [2019-12-18 13:31:13,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:13,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 13:31:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:13,436 INFO L225 Difference]: With dead ends: 8170 [2019-12-18 13:31:13,436 INFO L226 Difference]: Without dead ends: 8001 [2019-12-18 13:31:13,438 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:31:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-12-18 13:31:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2019-12-18 13:31:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8001 states. [2019-12-18 13:31:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 26077 transitions. [2019-12-18 13:31:13,839 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 26077 transitions. Word has length 5 [2019-12-18 13:31:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:13,840 INFO L462 AbstractCegarLoop]: Abstraction has 8001 states and 26077 transitions. [2019-12-18 13:31:13,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 26077 transitions. [2019-12-18 13:31:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:31:13,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:13,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:13,843 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash 336736415, now seen corresponding path program 1 times [2019-12-18 13:31:13,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:13,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473090513] [2019-12-18 13:31:13,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:13,977 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:31:13,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473090513] [2019-12-18 13:31:13,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:13,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:13,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097514561] [2019-12-18 13:31:13,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:13,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:13,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:13,981 INFO L87 Difference]: Start difference. First operand 8001 states and 26077 transitions. Second operand 4 states. [2019-12-18 13:31:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:14,492 INFO L93 Difference]: Finished difference Result 12769 states and 39815 transitions. [2019-12-18 13:31:14,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:14,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:31:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:14,589 INFO L225 Difference]: With dead ends: 12769 [2019-12-18 13:31:14,589 INFO L226 Difference]: Without dead ends: 12762 [2019-12-18 13:31:14,590 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:31:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-18 13:31:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 11253. [2019-12-18 13:31:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11253 states. [2019-12-18 13:31:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11253 states to 11253 states and 35607 transitions. [2019-12-18 13:31:15,733 INFO L78 Accepts]: Start accepts. Automaton has 11253 states and 35607 transitions. Word has length 11 [2019-12-18 13:31:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:15,734 INFO L462 AbstractCegarLoop]: Abstraction has 11253 states and 35607 transitions. [2019-12-18 13:31:15,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 11253 states and 35607 transitions. [2019-12-18 13:31:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:31:15,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:15,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:15,737 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1460182026, now seen corresponding path program 1 times [2019-12-18 13:31:15,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:15,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384832191] [2019-12-18 13:31:15,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:15,877 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:31:15,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384832191] [2019-12-18 13:31:15,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:15,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:15,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161611151] [2019-12-18 13:31:15,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:15,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:15,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:15,880 INFO L87 Difference]: Start difference. First operand 11253 states and 35607 transitions. Second operand 4 states. [2019-12-18 13:31:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:16,130 INFO L93 Difference]: Finished difference Result 14137 states and 44209 transitions. [2019-12-18 13:31:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:16,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:31:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:16,181 INFO L225 Difference]: With dead ends: 14137 [2019-12-18 13:31:16,181 INFO L226 Difference]: Without dead ends: 14137 [2019-12-18 13:31:16,181 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:31:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14137 states. [2019-12-18 13:31:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14137 to 12459. [2019-12-18 13:31:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12459 states. [2019-12-18 13:31:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12459 states to 12459 states and 39325 transitions. [2019-12-18 13:31:16,587 INFO L78 Accepts]: Start accepts. Automaton has 12459 states and 39325 transitions. Word has length 11 [2019-12-18 13:31:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:16,588 INFO L462 AbstractCegarLoop]: Abstraction has 12459 states and 39325 transitions. [2019-12-18 13:31:16,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 12459 states and 39325 transitions. [2019-12-18 13:31:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:31:16,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:16,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:16,597 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:16,598 INFO L82 PathProgramCache]: Analyzing trace with hash 289140598, now seen corresponding path program 1 times [2019-12-18 13:31:16,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:16,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578673444] [2019-12-18 13:31:16,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:16,733 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:31:16,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578673444] [2019-12-18 13:31:16,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:16,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:16,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190967620] [2019-12-18 13:31:16,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:16,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:16,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:16,736 INFO L87 Difference]: Start difference. First operand 12459 states and 39325 transitions. Second operand 5 states. [2019-12-18 13:31:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:17,310 INFO L93 Difference]: Finished difference Result 16999 states and 52476 transitions. [2019-12-18 13:31:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:31:17,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:31:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:17,364 INFO L225 Difference]: With dead ends: 16999 [2019-12-18 13:31:17,364 INFO L226 Difference]: Without dead ends: 16992 [2019-12-18 13:31:17,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:31:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16992 states. [2019-12-18 13:31:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16992 to 12516. [2019-12-18 13:31:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12516 states. [2019-12-18 13:31:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12516 states to 12516 states and 39375 transitions. [2019-12-18 13:31:17,933 INFO L78 Accepts]: Start accepts. Automaton has 12516 states and 39375 transitions. Word has length 17 [2019-12-18 13:31:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:17,934 INFO L462 AbstractCegarLoop]: Abstraction has 12516 states and 39375 transitions. [2019-12-18 13:31:17,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 12516 states and 39375 transitions. [2019-12-18 13:31:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:31:17,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:17,949 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] [2019-12-18 13:31:17,949 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:17,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1619137928, now seen corresponding path program 1 times [2019-12-18 13:31:17,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:17,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487797806] [2019-12-18 13:31:17,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:18,046 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:31:18,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487797806] [2019-12-18 13:31:18,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:18,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:18,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877297060] [2019-12-18 13:31:18,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:18,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:18,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:18,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:18,048 INFO L87 Difference]: Start difference. First operand 12516 states and 39375 transitions. Second operand 4 states. [2019-12-18 13:31:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:18,080 INFO L93 Difference]: Finished difference Result 2110 states and 4812 transitions. [2019-12-18 13:31:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:31:18,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:31:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:18,084 INFO L225 Difference]: With dead ends: 2110 [2019-12-18 13:31:18,085 INFO L226 Difference]: Without dead ends: 1824 [2019-12-18 13:31:18,085 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:31:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-12-18 13:31:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2019-12-18 13:31:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-12-18 13:31:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4021 transitions. [2019-12-18 13:31:18,117 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4021 transitions. Word has length 25 [2019-12-18 13:31:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:18,117 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 4021 transitions. [2019-12-18 13:31:18,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4021 transitions. [2019-12-18 13:31:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 13:31:18,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:18,121 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] [2019-12-18 13:31:18,121 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:18,122 INFO L82 PathProgramCache]: Analyzing trace with hash 736634855, now seen corresponding path program 1 times [2019-12-18 13:31:18,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:18,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971073294] [2019-12-18 13:31:18,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:18,224 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:31:18,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971073294] [2019-12-18 13:31:18,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:18,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:18,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044136574] [2019-12-18 13:31:18,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:18,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:18,227 INFO L87 Difference]: Start difference. First operand 1824 states and 4021 transitions. Second operand 5 states. [2019-12-18 13:31:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:18,267 INFO L93 Difference]: Finished difference Result 419 states and 767 transitions. [2019-12-18 13:31:18,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:18,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 13:31:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:18,269 INFO L225 Difference]: With dead ends: 419 [2019-12-18 13:31:18,269 INFO L226 Difference]: Without dead ends: 373 [2019-12-18 13:31:18,270 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:31:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-18 13:31:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 338. [2019-12-18 13:31:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-12-18 13:31:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 612 transitions. [2019-12-18 13:31:18,275 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 612 transitions. Word has length 37 [2019-12-18 13:31:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:18,276 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 612 transitions. [2019-12-18 13:31:18,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 612 transitions. [2019-12-18 13:31:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:31:18,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:18,278 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] [2019-12-18 13:31:18,278 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:18,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1915125863, now seen corresponding path program 1 times [2019-12-18 13:31:18,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:18,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594919384] [2019-12-18 13:31:18,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:18,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594919384] [2019-12-18 13:31:18,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:18,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:18,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707231360] [2019-12-18 13:31:18,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:18,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:18,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:18,356 INFO L87 Difference]: Start difference. First operand 338 states and 612 transitions. Second operand 3 states. [2019-12-18 13:31:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:18,398 INFO L93 Difference]: Finished difference Result 352 states and 630 transitions. [2019-12-18 13:31:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:18,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:31:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:18,399 INFO L225 Difference]: With dead ends: 352 [2019-12-18 13:31:18,399 INFO L226 Difference]: Without dead ends: 352 [2019-12-18 13:31:18,400 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:31:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-18 13:31:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-12-18 13:31:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-18 13:31:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-12-18 13:31:18,409 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 52 [2019-12-18 13:31:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:18,411 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-12-18 13:31:18,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-12-18 13:31:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:31:18,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:18,414 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] [2019-12-18 13:31:18,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1804822393, now seen corresponding path program 1 times [2019-12-18 13:31:18,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:18,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116138590] [2019-12-18 13:31:18,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:18,525 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:31:18,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116138590] [2019-12-18 13:31:18,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:18,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:18,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572395885] [2019-12-18 13:31:18,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:18,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:18,527 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-12-18 13:31:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:18,541 INFO L93 Difference]: Finished difference Result 348 states and 613 transitions. [2019-12-18 13:31:18,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:18,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:31:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:18,542 INFO L225 Difference]: With dead ends: 348 [2019-12-18 13:31:18,542 INFO L226 Difference]: Without dead ends: 348 [2019-12-18 13:31:18,543 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:31:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-18 13:31:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-12-18 13:31:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-18 13:31:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 613 transitions. [2019-12-18 13:31:18,548 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 613 transitions. Word has length 52 [2019-12-18 13:31:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:18,548 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 613 transitions. [2019-12-18 13:31:18,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 613 transitions. [2019-12-18 13:31:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:31:18,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:18,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:18,550 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1986059885, now seen corresponding path program 1 times [2019-12-18 13:31:18,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:18,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449663221] [2019-12-18 13:31:18,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:18,668 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:31:18,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449663221] [2019-12-18 13:31:18,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:18,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:31:18,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576107839] [2019-12-18 13:31:18,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:18,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:18,670 INFO L87 Difference]: Start difference. First operand 348 states and 613 transitions. Second operand 5 states. [2019-12-18 13:31:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:18,844 INFO L93 Difference]: Finished difference Result 479 states and 847 transitions. [2019-12-18 13:31:18,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:31:18,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 13:31:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:18,847 INFO L225 Difference]: With dead ends: 479 [2019-12-18 13:31:18,847 INFO L226 Difference]: Without dead ends: 479 [2019-12-18 13:31:18,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-18 13:31:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 426. [2019-12-18 13:31:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-18 13:31:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 753 transitions. [2019-12-18 13:31:18,860 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 753 transitions. Word has length 53 [2019-12-18 13:31:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:18,861 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 753 transitions. [2019-12-18 13:31:18,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 753 transitions. [2019-12-18 13:31:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:31:18,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:18,864 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] [2019-12-18 13:31:18,864 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2130042739, now seen corresponding path program 2 times [2019-12-18 13:31:18,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:18,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332100156] [2019-12-18 13:31:18,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:18,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:31:18,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332100156] [2019-12-18 13:31:18,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:18,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:18,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508270772] [2019-12-18 13:31:18,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:18,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:18,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:18,982 INFO L87 Difference]: Start difference. First operand 426 states and 753 transitions. Second operand 5 states. [2019-12-18 13:31:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:19,115 INFO L93 Difference]: Finished difference Result 522 states and 921 transitions. [2019-12-18 13:31:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:31:19,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 13:31:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:19,117 INFO L225 Difference]: With dead ends: 522 [2019-12-18 13:31:19,117 INFO L226 Difference]: Without dead ends: 522 [2019-12-18 13:31:19,117 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:31:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-12-18 13:31:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 440. [2019-12-18 13:31:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-12-18 13:31:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 779 transitions. [2019-12-18 13:31:19,123 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 779 transitions. Word has length 53 [2019-12-18 13:31:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:19,124 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 779 transitions. [2019-12-18 13:31:19,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 779 transitions. [2019-12-18 13:31:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:31:19,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:19,125 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] [2019-12-18 13:31:19,126 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:19,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1191623101, now seen corresponding path program 3 times [2019-12-18 13:31:19,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:19,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186302005] [2019-12-18 13:31:19,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:19,361 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:31:19,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186302005] [2019-12-18 13:31:19,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:19,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:31:19,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338216693] [2019-12-18 13:31:19,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:31:19,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:31:19,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:31:19,366 INFO L87 Difference]: Start difference. First operand 440 states and 779 transitions. Second operand 9 states. [2019-12-18 13:31:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:19,999 INFO L93 Difference]: Finished difference Result 714 states and 1245 transitions. [2019-12-18 13:31:19,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:31:19,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 13:31:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:20,001 INFO L225 Difference]: With dead ends: 714 [2019-12-18 13:31:20,001 INFO L226 Difference]: Without dead ends: 714 [2019-12-18 13:31:20,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:31:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-18 13:31:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 436. [2019-12-18 13:31:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-18 13:31:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 768 transitions. [2019-12-18 13:31:20,010 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 768 transitions. Word has length 53 [2019-12-18 13:31:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:20,011 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 768 transitions. [2019-12-18 13:31:20,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:31:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 768 transitions. [2019-12-18 13:31:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:31:20,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:20,012 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] [2019-12-18 13:31:20,013 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:20,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:20,013 INFO L82 PathProgramCache]: Analyzing trace with hash -424695835, now seen corresponding path program 4 times [2019-12-18 13:31:20,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:20,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771869948] [2019-12-18 13:31:20,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:20,085 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:31:20,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771869948] [2019-12-18 13:31:20,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:20,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:20,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158181983] [2019-12-18 13:31:20,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:20,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:20,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:20,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:20,088 INFO L87 Difference]: Start difference. First operand 436 states and 768 transitions. Second operand 3 states. [2019-12-18 13:31:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:20,144 INFO L93 Difference]: Finished difference Result 435 states and 766 transitions. [2019-12-18 13:31:20,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:20,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 13:31:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:20,145 INFO L225 Difference]: With dead ends: 435 [2019-12-18 13:31:20,145 INFO L226 Difference]: Without dead ends: 435 [2019-12-18 13:31:20,146 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:31:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-18 13:31:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 347. [2019-12-18 13:31:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-18 13:31:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 602 transitions. [2019-12-18 13:31:20,152 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 602 transitions. Word has length 53 [2019-12-18 13:31:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:20,152 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 602 transitions. [2019-12-18 13:31:20,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 602 transitions. [2019-12-18 13:31:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:31:20,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:20,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:20,154 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:20,154 INFO L82 PathProgramCache]: Analyzing trace with hash -752439480, now seen corresponding path program 1 times [2019-12-18 13:31:20,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:20,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548335265] [2019-12-18 13:31:20,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:20,417 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:31:20,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548335265] [2019-12-18 13:31:20,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:20,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:31:20,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576918996] [2019-12-18 13:31:20,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:31:20,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:20,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:31:20,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:31:20,421 INFO L87 Difference]: Start difference. First operand 347 states and 602 transitions. Second operand 12 states. [2019-12-18 13:31:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:21,011 INFO L93 Difference]: Finished difference Result 752 states and 1262 transitions. [2019-12-18 13:31:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:31:21,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 13:31:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:21,012 INFO L225 Difference]: With dead ends: 752 [2019-12-18 13:31:21,013 INFO L226 Difference]: Without dead ends: 220 [2019-12-18 13:31:21,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:31:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-18 13:31:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-12-18 13:31:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-18 13:31:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 337 transitions. [2019-12-18 13:31:21,018 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 337 transitions. Word has length 54 [2019-12-18 13:31:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:21,018 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 337 transitions. [2019-12-18 13:31:21,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:31:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 337 transitions. [2019-12-18 13:31:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:31:21,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:21,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:21,019 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash 516281010, now seen corresponding path program 2 times [2019-12-18 13:31:21,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:21,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439569969] [2019-12-18 13:31:21,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:31:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:31:21,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:31:21,125 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:31:21,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$r_buff1_thd2~0_157) (= 0 v_~weak$$choice0~0_14) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1101~0.base_20| 4)) (= |v_#NULL.offset_6| 0) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (= 0 |v_ULTIMATE.start_main_~#t1101~0.offset_15|) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 v_~__unbuffered_cnt~0_64) (= (store .cse0 |v_ULTIMATE.start_main_~#t1101~0.base_20| 1) |v_#valid_44|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= 0 v_~x$w_buff0_used~0_638) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1101~0.base_20|)) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1101~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1101~0.base_20|) |v_ULTIMATE.start_main_~#t1101~0.offset_15| 0)) |v_#memory_int_17|) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1101~0.base_20|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1101~0.offset=|v_ULTIMATE.start_main_~#t1101~0.offset_15|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1101~0.base=|v_ULTIMATE.start_main_~#t1101~0.base_20|, ~y~0=v_~y~0_115, ULTIMATE.start_main_~#t1102~0.base=|v_ULTIMATE.start_main_~#t1102~0.base_17|, ULTIMATE.start_main_~#t1102~0.offset=|v_ULTIMATE.start_main_~#t1102~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_~#t1101~0.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1101~0.base, ~y~0, ULTIMATE.start_main_~#t1102~0.base, ULTIMATE.start_main_~#t1102~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 13:31:21,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1102~0.base_11|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1102~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1102~0.base_11|) |v_ULTIMATE.start_main_~#t1102~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1102~0.base_11| 4)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1102~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1102~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1102~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1102~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1102~0.base=|v_ULTIMATE.start_main_~#t1102~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1102~0.offset=|v_ULTIMATE.start_main_~#t1102~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1102~0.base, ULTIMATE.start_main_~#t1102~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 13:31:21,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= 1 v_~x$w_buff0_used~0_78) (= (mod v_~x$w_buff1_used~0_47 256) 0) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 13:31:21,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-486127511| |P0Thread1of1ForFork0_#t~ite3_Out-486127511|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-486127511 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-486127511 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In-486127511 |P0Thread1of1ForFork0_#t~ite3_Out-486127511|)) (and (= ~x$w_buff1~0_In-486127511 |P0Thread1of1ForFork0_#t~ite3_Out-486127511|) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-486127511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-486127511, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-486127511, ~x~0=~x~0_In-486127511} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-486127511|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-486127511|, ~x$w_buff1~0=~x$w_buff1~0_In-486127511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-486127511, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-486127511, ~x~0=~x~0_In-486127511} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:31:21,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-211679381 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-211679381 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-211679381| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-211679381 |P0Thread1of1ForFork0_#t~ite5_Out-211679381|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-211679381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-211679381} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-211679381|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-211679381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-211679381} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:31:21,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In126747975 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In126747975 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In126747975 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In126747975 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out126747975| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out126747975| ~x$w_buff1_used~0_In126747975) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In126747975, ~x$w_buff1_used~0=~x$w_buff1_used~0_In126747975, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In126747975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In126747975} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out126747975|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In126747975, ~x$w_buff1_used~0=~x$w_buff1_used~0_In126747975, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In126747975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In126747975} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:31:21,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-379840433 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-379840433 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-379840433|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-379840433 |P0Thread1of1ForFork0_#t~ite7_Out-379840433|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-379840433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-379840433} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-379840433, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-379840433|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-379840433} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:31:21,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-16167448 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-16167448 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-16167448 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-16167448 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-16167448| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In-16167448 |P0Thread1of1ForFork0_#t~ite8_Out-16167448|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-16167448, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-16167448, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-16167448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-16167448} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-16167448, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-16167448|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-16167448, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-16167448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-16167448} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:31:21,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 13:31:21,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1237703804 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1237703804 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1237703804|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1237703804| ~x$w_buff0_used~0_In-1237703804) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1237703804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1237703804} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1237703804|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1237703804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1237703804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:31:21,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1608029076 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1608029076 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1608029076 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1608029076 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1608029076 |P1Thread1of1ForFork1_#t~ite12_Out-1608029076|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1608029076|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1608029076, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1608029076, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1608029076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1608029076} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1608029076, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1608029076, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1608029076|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1608029076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1608029076} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:31:21,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1295572497 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1295572497 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-1295572497 0)) (and (= ~x$r_buff0_thd2~0_Out-1295572497 ~x$r_buff0_thd2~0_In-1295572497) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1295572497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1295572497} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1295572497|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1295572497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1295572497} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 13:31:21,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In2112753453 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In2112753453 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2112753453 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2112753453 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out2112753453| ~x$r_buff1_thd2~0_In2112753453) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out2112753453| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2112753453, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2112753453, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2112753453, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2112753453} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2112753453, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2112753453, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2112753453, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2112753453|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2112753453} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:31:21,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:31:21,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:31:21,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-567308391 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-567308391 256) 0))) (or (and (= ~x$w_buff1~0_In-567308391 |ULTIMATE.start_main_#t~ite17_Out-567308391|) (not .cse0) (not .cse1)) (and (= ~x~0_In-567308391 |ULTIMATE.start_main_#t~ite17_Out-567308391|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-567308391, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-567308391, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-567308391, ~x~0=~x~0_In-567308391} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-567308391|, ~x$w_buff1~0=~x$w_buff1~0_In-567308391, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-567308391, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-567308391, ~x~0=~x~0_In-567308391} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 13:31:21,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 13:31:21,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1485096201 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1485096201 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1485096201 |ULTIMATE.start_main_#t~ite19_Out-1485096201|)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out-1485096201|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1485096201, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1485096201} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1485096201, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1485096201|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1485096201} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:31:21,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1697436891 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1697436891 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1697436891 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1697436891 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out-1697436891| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1697436891 |ULTIMATE.start_main_#t~ite20_Out-1697436891|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1697436891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1697436891, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1697436891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1697436891} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1697436891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1697436891, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1697436891|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1697436891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1697436891} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:31:21,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2119051648 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2119051648 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out2119051648| ~x$r_buff0_thd0~0_In2119051648)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out2119051648|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2119051648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2119051648} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2119051648, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2119051648|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2119051648} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:31:21,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-705549527 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-705549527 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-705549527 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-705549527 256)))) (or (and (= ~x$r_buff1_thd0~0_In-705549527 |ULTIMATE.start_main_#t~ite22_Out-705549527|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out-705549527| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-705549527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-705549527, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-705549527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705549527} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-705549527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-705549527, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-705549527, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-705549527|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705549527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:31:21,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1248748154 256)))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-1248748154| ~x$w_buff1~0_In-1248748154) (= |ULTIMATE.start_main_#t~ite32_Out-1248748154| |ULTIMATE.start_main_#t~ite31_Out-1248748154|) (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1248748154 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-1248748154 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1248748154 256))) (and .cse0 (= (mod ~x$w_buff1_used~0_In-1248748154 256) 0)))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite32_Out-1248748154| ~x$w_buff1~0_In-1248748154) (= |ULTIMATE.start_main_#t~ite31_In-1248748154| |ULTIMATE.start_main_#t~ite31_Out-1248748154|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1248748154, ~x$w_buff1~0=~x$w_buff1~0_In-1248748154, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1248748154, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1248748154, ~weak$$choice2~0=~weak$$choice2~0_In-1248748154, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1248748154|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1248748154} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1248748154, ~x$w_buff1~0=~x$w_buff1~0_In-1248748154, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1248748154, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1248748154|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1248748154, ~weak$$choice2~0=~weak$$choice2~0_In-1248748154, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1248748154|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1248748154} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 13:31:21,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-335143505 256)))) (or (and (= ~x$w_buff1_used~0_In-335143505 |ULTIMATE.start_main_#t~ite37_Out-335143505|) (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-335143505 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-335143505 256) 0) (and (= 0 (mod ~x$r_buff1_thd0~0_In-335143505 256)) .cse0) (and (= (mod ~x$w_buff1_used~0_In-335143505 256) 0) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite38_Out-335143505| |ULTIMATE.start_main_#t~ite37_Out-335143505|)) (and (= |ULTIMATE.start_main_#t~ite37_In-335143505| |ULTIMATE.start_main_#t~ite37_Out-335143505|) (= |ULTIMATE.start_main_#t~ite38_Out-335143505| ~x$w_buff1_used~0_In-335143505) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-335143505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-335143505, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-335143505|, ~weak$$choice2~0=~weak$$choice2~0_In-335143505, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-335143505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-335143505} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-335143505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-335143505, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-335143505|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-335143505|, ~weak$$choice2~0=~weak$$choice2~0_In-335143505, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-335143505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-335143505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:31:21,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:31:21,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:31:21,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:31:21,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:31:21 BasicIcfg [2019-12-18 13:31:21,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:31:21,243 INFO L168 Benchmark]: Toolchain (without parser) took 15333.61 ms. Allocated memory was 145.8 MB in the beginning and 601.4 MB in the end (delta: 455.6 MB). Free memory was 101.0 MB in the beginning and 207.5 MB in the end (delta: -106.5 MB). Peak memory consumption was 349.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:21,244 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:31:21,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.59 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 158.1 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:21,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.37 ms. Allocated memory is still 203.4 MB. Free memory was 158.1 MB in the beginning and 154.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:21,248 INFO L168 Benchmark]: Boogie Preprocessor took 38.44 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:21,251 INFO L168 Benchmark]: RCFGBuilder took 776.94 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 108.2 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:21,252 INFO L168 Benchmark]: TraceAbstraction took 13655.51 ms. Allocated memory was 203.4 MB in the beginning and 601.4 MB in the end (delta: 397.9 MB). Free memory was 107.5 MB in the beginning and 207.5 MB in the end (delta: -100.0 MB). Peak memory consumption was 297.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:21,261 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.53 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.59 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 158.1 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.37 ms. Allocated memory is still 203.4 MB. Free memory was 158.1 MB in the beginning and 154.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.44 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 776.94 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 108.2 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13655.51 ms. Allocated memory was 203.4 MB in the beginning and 601.4 MB in the end (delta: 397.9 MB). Free memory was 107.5 MB in the beginning and 207.5 MB in the end (delta: -100.0 MB). Peak memory consumption was 297.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 88 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 3874 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 57 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 45620 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1101, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1102, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1359 SDtfs, 1435 SDslu, 2432 SDs, 0 SdLazy, 1533 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12516occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 8227 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 66603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...