/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:32:07,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:32:07,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:32:07,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:32:07,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:32:07,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:32:07,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:32:07,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:32:07,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:32:07,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:32:07,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:32:07,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:32:07,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:32:07,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:32:07,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:32:07,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:32:07,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:32:07,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:32:07,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:32:07,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:32:07,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:32:07,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:32:07,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:32:07,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:32:07,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:32:07,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:32:07,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:32:07,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:32:07,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:32:07,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:32:07,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:32:07,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:32:07,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:32:07,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:32:07,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:32:07,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:32:07,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:32:07,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:32:07,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:32:07,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:32:07,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:32:07,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:32:07,826 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:32:07,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:32:07,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:32:07,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:32:07,828 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:32:07,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:32:07,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:32:07,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:32:07,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:32:07,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:32:07,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:32:07,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:32:07,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:32:07,829 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:32:07,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:32:07,830 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:32:07,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:32:07,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:32:07,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:32:07,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:32:07,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:32:07,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:32:07,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:32:07,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:32:07,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:32:07,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:32:07,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:32:07,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:32:07,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:32:08,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:32:08,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:32:08,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:32:08,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:32:08,145 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:32:08,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-18 18:32:08,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badb7d9a4/0ad492c7f1d04e76915912bd16e6a6f7/FLAGed92034fe [2019-12-18 18:32:08,771 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:32:08,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-18 18:32:08,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badb7d9a4/0ad492c7f1d04e76915912bd16e6a6f7/FLAGed92034fe [2019-12-18 18:32:09,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badb7d9a4/0ad492c7f1d04e76915912bd16e6a6f7 [2019-12-18 18:32:09,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:32:09,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:32:09,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:32:09,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:32:09,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:32:09,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a85e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09, skipping insertion in model container [2019-12-18 18:32:09,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:32:09,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:32:09,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:32:09,685 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:32:09,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:32:09,855 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:32:09,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09 WrapperNode [2019-12-18 18:32:09,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:32:09,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:32:09,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:32:09,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:32:09,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:32:09,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:32:09,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:32:09,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:32:09,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (1/1) ... [2019-12-18 18:32:09,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:32:09,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:32:09,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:32:09,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:32:09,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (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 18:32:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:32:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:32:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:32:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:32:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:32:10,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:32:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:32:10,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:32:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:32:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:32:10,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:32:10,079 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 18:32:10,789 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:32:10,790 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:32:10,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:32:10 BoogieIcfgContainer [2019-12-18 18:32:10,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:32:10,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:32:10,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:32:10,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:32:10,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:32:09" (1/3) ... [2019-12-18 18:32:10,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faa36e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:32:10, skipping insertion in model container [2019-12-18 18:32:10,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:09" (2/3) ... [2019-12-18 18:32:10,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faa36e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:32:10, skipping insertion in model container [2019-12-18 18:32:10,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:32:10" (3/3) ... [2019-12-18 18:32:10,799 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2019-12-18 18:32:10,810 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:32:10,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:32:10,818 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:32:10,819 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:32:10,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,877 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,880 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,881 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:10,897 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:32:10,917 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:32:10,918 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:32:10,918 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:32:10,918 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:32:10,918 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:32:10,918 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:32:10,919 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:32:10,919 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:32:10,936 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 18:32:10,938 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 18:32:11,039 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 18:32:11,040 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:32:11,052 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:32:11,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 18:32:11,116 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 18:32:11,116 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:32:11,122 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:32:11,136 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 18:32:11,137 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:32:15,827 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 18:32:15,956 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-18 18:32:15,956 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 18:32:15,960 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-18 18:32:16,440 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-18 18:32:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-18 18:32:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:32:16,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:16,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:32:16,448 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-18 18:32:16,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:16,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503439776] [2019-12-18 18:32:16,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:16,655 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 18:32:16,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503439776] [2019-12-18 18:32:16,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:16,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:32:16,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357526320] [2019-12-18 18:32:16,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:32:16,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:16,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:32:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:16,683 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-18 18:32:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:16,964 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-18 18:32:16,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:32:16,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:32:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:17,109 INFO L225 Difference]: With dead ends: 8604 [2019-12-18 18:32:17,109 INFO L226 Difference]: Without dead ends: 8436 [2019-12-18 18:32:17,111 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 18:32:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-18 18:32:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-18 18:32:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-18 18:32:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-18 18:32:17,536 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-18 18:32:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:17,536 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-18 18:32:17,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:32:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-18 18:32:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:32:17,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:17,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:32:17,540 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:17,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-18 18:32:17,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:17,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672243332] [2019-12-18 18:32:17,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:17,645 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 18:32:17,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672243332] [2019-12-18 18:32:17,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:17,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:32:17,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176335865] [2019-12-18 18:32:17,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:32:17,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:17,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:32:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:32:17,650 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-18 18:32:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:18,652 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-18 18:32:18,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:32:18,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:32:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:18,724 INFO L225 Difference]: With dead ends: 13130 [2019-12-18 18:32:18,725 INFO L226 Difference]: Without dead ends: 13123 [2019-12-18 18:32:18,725 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 18:32:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-18 18:32:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-18 18:32:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-18 18:32:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-18 18:32:19,163 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-18 18:32:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:19,163 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-18 18:32:19,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:32:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-18 18:32:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:32:19,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:19,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:32:19,167 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:19,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:19,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-18 18:32:19,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:19,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155462187] [2019-12-18 18:32:19,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:19,243 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 18:32:19,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155462187] [2019-12-18 18:32:19,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:19,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:32:19,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849414961] [2019-12-18 18:32:19,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:32:19,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:19,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:32:19,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:32:19,245 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-18 18:32:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:19,617 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-18 18:32:19,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:32:19,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:32:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:19,676 INFO L225 Difference]: With dead ends: 14736 [2019-12-18 18:32:19,676 INFO L226 Difference]: Without dead ends: 14736 [2019-12-18 18:32:19,677 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 18:32:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-18 18:32:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-18 18:32:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-18 18:32:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-18 18:32:20,348 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-18 18:32:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:20,348 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-18 18:32:20,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:32:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-18 18:32:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 18:32:20,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:20,357 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 18:32:20,358 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:20,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:20,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-18 18:32:20,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:20,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853034816] [2019-12-18 18:32:20,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:20,464 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 18:32:20,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853034816] [2019-12-18 18:32:20,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:20,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:32:20,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987553313] [2019-12-18 18:32:20,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:32:20,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:32:20,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:32:20,469 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-18 18:32:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:20,943 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-18 18:32:20,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:32:20,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 18:32:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:21,004 INFO L225 Difference]: With dead ends: 17572 [2019-12-18 18:32:21,004 INFO L226 Difference]: Without dead ends: 17565 [2019-12-18 18:32:21,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 18:32:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-18 18:32:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-18 18:32:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-18 18:32:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-18 18:32:21,566 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-18 18:32:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:21,566 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-18 18:32:21,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:32:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-18 18:32:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:32:21,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:21,582 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 18:32:21,582 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-18 18:32:21,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:21,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114391516] [2019-12-18 18:32:21,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:21,663 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 18:32:21,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114391516] [2019-12-18 18:32:21,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:21,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:32:21,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294821559] [2019-12-18 18:32:21,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:32:21,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:21,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:32:21,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:21,666 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-18 18:32:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:21,784 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-18 18:32:21,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:32:21,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 18:32:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:21,839 INFO L225 Difference]: With dead ends: 16057 [2019-12-18 18:32:21,839 INFO L226 Difference]: Without dead ends: 16057 [2019-12-18 18:32:21,839 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 18:32:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-18 18:32:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-18 18:32:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-18 18:32:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-18 18:32:22,455 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-18 18:32:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:22,457 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-18 18:32:22,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:32:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-18 18:32:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:32:22,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:22,469 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 18:32:22,469 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-18 18:32:22,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:22,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396164805] [2019-12-18 18:32:22,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:22,548 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 18:32:22,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396164805] [2019-12-18 18:32:22,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:22,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:32:22,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786298855] [2019-12-18 18:32:22,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:32:22,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:32:22,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:32:22,551 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-18 18:32:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:22,589 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-18 18:32:22,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:32:22,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:32:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:22,592 INFO L225 Difference]: With dead ends: 2296 [2019-12-18 18:32:22,592 INFO L226 Difference]: Without dead ends: 2019 [2019-12-18 18:32:22,593 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 18:32:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-18 18:32:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-18 18:32:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-18 18:32:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-18 18:32:22,623 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-18 18:32:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:22,624 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-18 18:32:22,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:32:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-18 18:32:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:32:22,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:22,628 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 18:32:22,628 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-18 18:32:22,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:22,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466261075] [2019-12-18 18:32:22,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:22,727 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 18:32:22,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466261075] [2019-12-18 18:32:22,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:22,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:32:22,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151122818] [2019-12-18 18:32:22,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:32:22,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:32:22,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:32:22,729 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-18 18:32:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:22,769 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-18 18:32:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:32:22,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:32:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:22,771 INFO L225 Difference]: With dead ends: 416 [2019-12-18 18:32:22,771 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 18:32:22,771 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 18:32:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 18:32:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-18 18:32:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 18:32:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-18 18:32:22,777 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-18 18:32:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:22,777 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-18 18:32:22,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:32:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-18 18:32:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:32:22,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:22,780 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 18:32:22,780 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-18 18:32:22,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:22,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087882677] [2019-12-18 18:32:22,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:22,913 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 18:32:22,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087882677] [2019-12-18 18:32:22,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:22,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:32:22,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758378416] [2019-12-18 18:32:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:32:22,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:32:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:22,916 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 3 states. [2019-12-18 18:32:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:22,958 INFO L93 Difference]: Finished difference Result 343 states and 617 transitions. [2019-12-18 18:32:22,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:32:22,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:32:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:22,959 INFO L225 Difference]: With dead ends: 343 [2019-12-18 18:32:22,960 INFO L226 Difference]: Without dead ends: 343 [2019-12-18 18:32:22,960 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 18:32:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-18 18:32:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-12-18 18:32:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 18:32:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 617 transitions. [2019-12-18 18:32:22,965 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 617 transitions. Word has length 52 [2019-12-18 18:32:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:22,965 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 617 transitions. [2019-12-18 18:32:22,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:32:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 617 transitions. [2019-12-18 18:32:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:32:22,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:22,967 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 18:32:22,967 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:22,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1294054807, now seen corresponding path program 1 times [2019-12-18 18:32:22,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:22,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509492914] [2019-12-18 18:32:22,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:23,016 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 18:32:23,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509492914] [2019-12-18 18:32:23,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:23,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:32:23,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440300837] [2019-12-18 18:32:23,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:32:23,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:32:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:23,020 INFO L87 Difference]: Start difference. First operand 343 states and 617 transitions. Second operand 3 states. [2019-12-18 18:32:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:23,033 INFO L93 Difference]: Finished difference Result 331 states and 581 transitions. [2019-12-18 18:32:23,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:32:23,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:32:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:23,034 INFO L225 Difference]: With dead ends: 331 [2019-12-18 18:32:23,034 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 18:32:23,035 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 18:32:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 18:32:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-12-18 18:32:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-18 18:32:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 581 transitions. [2019-12-18 18:32:23,040 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 581 transitions. Word has length 53 [2019-12-18 18:32:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:23,040 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 581 transitions. [2019-12-18 18:32:23,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:32:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 581 transitions. [2019-12-18 18:32:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:23,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:23,041 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 18:32:23,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash -731863498, now seen corresponding path program 1 times [2019-12-18 18:32:23,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:23,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079718616] [2019-12-18 18:32:23,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:23,200 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 18:32:23,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079718616] [2019-12-18 18:32:23,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:23,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:32:23,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469795987] [2019-12-18 18:32:23,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:32:23,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:23,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:32:23,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:32:23,203 INFO L87 Difference]: Start difference. First operand 331 states and 581 transitions. Second operand 7 states. [2019-12-18 18:32:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:23,291 INFO L93 Difference]: Finished difference Result 534 states and 938 transitions. [2019-12-18 18:32:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:32:23,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:32:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:23,292 INFO L225 Difference]: With dead ends: 534 [2019-12-18 18:32:23,293 INFO L226 Difference]: Without dead ends: 245 [2019-12-18 18:32:23,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:32:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-18 18:32:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 221. [2019-12-18 18:32:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-18 18:32:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 391 transitions. [2019-12-18 18:32:23,297 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 391 transitions. Word has length 54 [2019-12-18 18:32:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:23,297 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 391 transitions. [2019-12-18 18:32:23,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:32:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 391 transitions. [2019-12-18 18:32:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:23,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:23,299 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 18:32:23,299 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 2 times [2019-12-18 18:32:23,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:23,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725097594] [2019-12-18 18:32:23,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:23,656 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 18:32:23,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725097594] [2019-12-18 18:32:23,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:23,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:32:23,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321046523] [2019-12-18 18:32:23,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:32:23,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:32:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:32:23,659 INFO L87 Difference]: Start difference. First operand 221 states and 391 transitions. Second operand 13 states. [2019-12-18 18:32:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:24,162 INFO L93 Difference]: Finished difference Result 388 states and 665 transitions. [2019-12-18 18:32:24,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 18:32:24,163 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 18:32:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:24,164 INFO L225 Difference]: With dead ends: 388 [2019-12-18 18:32:24,164 INFO L226 Difference]: Without dead ends: 355 [2019-12-18 18:32:24,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:32:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-18 18:32:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 321. [2019-12-18 18:32:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-18 18:32:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 562 transitions. [2019-12-18 18:32:24,171 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 562 transitions. Word has length 54 [2019-12-18 18:32:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:24,172 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 562 transitions. [2019-12-18 18:32:24,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:32:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 562 transitions. [2019-12-18 18:32:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:24,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:24,173 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 18:32:24,173 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 3 times [2019-12-18 18:32:24,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:24,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381183458] [2019-12-18 18:32:24,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:24,711 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-12-18 18:32:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:25,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381183458] [2019-12-18 18:32:25,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:25,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 18:32:25,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540574310] [2019-12-18 18:32:25,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 18:32:25,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 18:32:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:32:25,194 INFO L87 Difference]: Start difference. First operand 321 states and 562 transitions. Second operand 18 states. [2019-12-18 18:32:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:26,253 INFO L93 Difference]: Finished difference Result 610 states and 1046 transitions. [2019-12-18 18:32:26,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:32:26,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-18 18:32:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:26,255 INFO L225 Difference]: With dead ends: 610 [2019-12-18 18:32:26,255 INFO L226 Difference]: Without dead ends: 577 [2019-12-18 18:32:26,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:32:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-18 18:32:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 343. [2019-12-18 18:32:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 18:32:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 604 transitions. [2019-12-18 18:32:26,262 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 604 transitions. Word has length 54 [2019-12-18 18:32:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:26,262 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 604 transitions. [2019-12-18 18:32:26,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 18:32:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 604 transitions. [2019-12-18 18:32:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:26,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:26,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:32:26,264 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -778167690, now seen corresponding path program 4 times [2019-12-18 18:32:26,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:26,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154397704] [2019-12-18 18:32:26,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:26,891 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 18:32:26,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154397704] [2019-12-18 18:32:26,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:26,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 18:32:26,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786815750] [2019-12-18 18:32:26,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 18:32:26,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:26,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 18:32:26,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-12-18 18:32:26,894 INFO L87 Difference]: Start difference. First operand 343 states and 604 transitions. Second operand 21 states. [2019-12-18 18:32:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:28,639 INFO L93 Difference]: Finished difference Result 777 states and 1336 transitions. [2019-12-18 18:32:28,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 18:32:28,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-12-18 18:32:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:28,641 INFO L225 Difference]: With dead ends: 777 [2019-12-18 18:32:28,641 INFO L226 Difference]: Without dead ends: 744 [2019-12-18 18:32:28,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 18:32:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-12-18 18:32:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 347. [2019-12-18 18:32:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-18 18:32:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 612 transitions. [2019-12-18 18:32:28,649 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 612 transitions. Word has length 54 [2019-12-18 18:32:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:28,649 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 612 transitions. [2019-12-18 18:32:28,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 18:32:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 612 transitions. [2019-12-18 18:32:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:28,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:28,650 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 18:32:28,650 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:28,650 INFO L82 PathProgramCache]: Analyzing trace with hash 404487136, now seen corresponding path program 5 times [2019-12-18 18:32:28,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:28,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973153693] [2019-12-18 18:32:28,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:28,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973153693] [2019-12-18 18:32:28,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:28,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:32:28,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882322821] [2019-12-18 18:32:28,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:32:28,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:28,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:32:28,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:32:28,871 INFO L87 Difference]: Start difference. First operand 347 states and 612 transitions. Second operand 12 states. [2019-12-18 18:32:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:29,205 INFO L93 Difference]: Finished difference Result 450 states and 766 transitions. [2019-12-18 18:32:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:32:29,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 18:32:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:29,206 INFO L225 Difference]: With dead ends: 450 [2019-12-18 18:32:29,206 INFO L226 Difference]: Without dead ends: 417 [2019-12-18 18:32:29,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:32:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-12-18 18:32:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 329. [2019-12-18 18:32:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-18 18:32:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 576 transitions. [2019-12-18 18:32:29,210 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 576 transitions. Word has length 54 [2019-12-18 18:32:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:29,211 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 576 transitions. [2019-12-18 18:32:29,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:32:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 576 transitions. [2019-12-18 18:32:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:29,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:29,212 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 18:32:29,212 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:29,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 6 times [2019-12-18 18:32:29,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:29,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030300090] [2019-12-18 18:32:29,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:32:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:32:29,305 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:32:29,306 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:32:29,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2011~0.base_24| 1)) (= v_~y$w_buff0_used~0_834 0) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard1~0_27 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2011~0.base_24|) 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2011~0.base_24|) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= |v_ULTIMATE.start_main_~#t2011~0.offset_19| 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2011~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2011~0.base_24|) |v_ULTIMATE.start_main_~#t2011~0.offset_19| 0))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2011~0.base_24| 4) |v_#length_13|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, ULTIMATE.start_main_~#t2011~0.base=|v_ULTIMATE.start_main_~#t2011~0.base_24|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_~#t2012~0.offset=|v_ULTIMATE.start_main_~#t2012~0.offset_16|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ULTIMATE.start_main_~#t2012~0.base=|v_ULTIMATE.start_main_~#t2012~0.base_19|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_~#t2011~0.offset=|v_ULTIMATE.start_main_~#t2011~0.offset_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2011~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2012~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t2012~0.base, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2011~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:32:29,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2012~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2012~0.base_11|) |v_ULTIMATE.start_main_~#t2012~0.offset_10| 1)) |v_#memory_int_7|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2012~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2012~0.base_11| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2012~0.base_11| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t2012~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2012~0.base_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2012~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2012~0.base=|v_ULTIMATE.start_main_~#t2012~0.base_11|, ULTIMATE.start_main_~#t2012~0.offset=|v_ULTIMATE.start_main_~#t2012~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2012~0.base, ULTIMATE.start_main_~#t2012~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 18:32:29,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:32:29,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1123833600 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1123833600 256)))) (or (and (= ~y$w_buff1~0_In1123833600 |P1Thread1of1ForFork1_#t~ite9_Out1123833600|) (not .cse0) (not .cse1)) (and (= ~y~0_In1123833600 |P1Thread1of1ForFork1_#t~ite9_Out1123833600|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1123833600, ~y$w_buff1~0=~y$w_buff1~0_In1123833600, ~y~0=~y~0_In1123833600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1123833600} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1123833600, ~y$w_buff1~0=~y$w_buff1~0_In1123833600, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1123833600|, ~y~0=~y~0_In1123833600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1123833600} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 18:32:29,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 18:32:29,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-737914189 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-737914189 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-737914189|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-737914189 |P1Thread1of1ForFork1_#t~ite11_Out-737914189|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-737914189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-737914189} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-737914189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-737914189, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-737914189|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:32:29,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1086831528 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1086831528 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1086831528 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1086831528 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-1086831528| ~y$w_buff1_used~0_In-1086831528) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1086831528| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1086831528, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1086831528, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1086831528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1086831528} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1086831528, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1086831528, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1086831528, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1086831528|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1086831528} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:32:29,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1661787481 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1661787481 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1661787481|)) (and (= ~y$r_buff0_thd2~0_In-1661787481 |P1Thread1of1ForFork1_#t~ite13_Out-1661787481|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1661787481, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1661787481} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1661787481, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1661787481, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1661787481|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:32:29,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-588128976 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-588128976 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-588128976 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-588128976 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-588128976|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-588128976| ~y$r_buff1_thd2~0_In-588128976)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-588128976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-588128976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-588128976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-588128976} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-588128976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-588128976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-588128976, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-588128976|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-588128976} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:32:29,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:32:29,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In784382562 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In784382562 256)))) (or (and (= ~y$w_buff0_used~0_In784382562 |P0Thread1of1ForFork0_#t~ite5_Out784382562|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out784382562|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In784382562, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In784382562} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out784382562|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In784382562, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In784382562} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:32:29,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1191994967 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1191994967 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1191994967 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1191994967 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1191994967| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1191994967 |P0Thread1of1ForFork0_#t~ite6_Out1191994967|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1191994967, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1191994967, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1191994967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1191994967} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1191994967|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1191994967, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1191994967, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1191994967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1191994967} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:32:29,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-236047924 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-236047924 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-236047924) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out-236047924 ~y$r_buff0_thd1~0_In-236047924) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-236047924, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-236047924} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-236047924, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-236047924|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-236047924} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:32:29,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-375750088 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-375750088 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-375750088 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-375750088 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-375750088| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-375750088| ~y$r_buff1_thd1~0_In-375750088)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-375750088, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-375750088, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-375750088, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-375750088} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-375750088, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-375750088, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-375750088|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-375750088, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-375750088} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:32:29,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |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_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:32:29,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:32:29,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In38681620 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In38681620 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out38681620| |ULTIMATE.start_main_#t~ite17_Out38681620|))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite17_Out38681620| ~y~0_In38681620)) (and (not .cse1) (not .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite17_Out38681620| ~y$w_buff1~0_In38681620)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In38681620, ~y~0=~y~0_In38681620, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In38681620, ~y$w_buff1_used~0=~y$w_buff1_used~0_In38681620} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out38681620|, ~y$w_buff1~0=~y$w_buff1~0_In38681620, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out38681620|, ~y~0=~y~0_In38681620, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In38681620, ~y$w_buff1_used~0=~y$w_buff1_used~0_In38681620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 18:32:29,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-357142579 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-357142579 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-357142579| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-357142579| ~y$w_buff0_used~0_In-357142579)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-357142579, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-357142579} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-357142579, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-357142579|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-357142579} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 18:32:29,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1239660788 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1239660788 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1239660788 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1239660788 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1239660788|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out1239660788| ~y$w_buff1_used~0_In1239660788) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1239660788, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1239660788, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1239660788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1239660788} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1239660788, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1239660788, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1239660788|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1239660788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1239660788} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 18:32:29,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1645904381 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1645904381 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out1645904381|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1645904381 |ULTIMATE.start_main_#t~ite21_Out1645904381|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1645904381, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1645904381} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1645904381, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1645904381, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1645904381|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 18:32:29,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1930954309 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1930954309 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1930954309 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1930954309 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1930954309|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1930954309 |ULTIMATE.start_main_#t~ite22_Out-1930954309|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1930954309, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1930954309, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1930954309, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1930954309} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1930954309, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1930954309, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1930954309, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1930954309|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1930954309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 18:32:29,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1705403265 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_In-1705403265| |ULTIMATE.start_main_#t~ite31_Out-1705403265|) (not .cse0) (= ~y$w_buff1~0_In-1705403265 |ULTIMATE.start_main_#t~ite32_Out-1705403265|)) (and (= |ULTIMATE.start_main_#t~ite32_Out-1705403265| |ULTIMATE.start_main_#t~ite31_Out-1705403265|) (= ~y$w_buff1~0_In-1705403265 |ULTIMATE.start_main_#t~ite31_Out-1705403265|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1705403265 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1705403265 256))) (= (mod ~y$w_buff0_used~0_In-1705403265 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1705403265 256)))))))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1705403265, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705403265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1705403265, ~weak$$choice2~0=~weak$$choice2~0_In-1705403265, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1705403265|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1705403265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705403265} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1705403265, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705403265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1705403265, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1705403265|, ~weak$$choice2~0=~weak$$choice2~0_In-1705403265, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1705403265|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1705403265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705403265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 18:32:29,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 18:32:29,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:32:29,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:32:29,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:32:29 BasicIcfg [2019-12-18 18:32:29,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:32:29,411 INFO L168 Benchmark]: Toolchain (without parser) took 20346.22 ms. Allocated memory was 135.8 MB in the beginning and 812.1 MB in the end (delta: 676.3 MB). Free memory was 99.1 MB in the beginning and 503.9 MB in the end (delta: -404.8 MB). Peak memory consumption was 271.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:29,412 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:32:29,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.16 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 98.7 MB in the beginning and 155.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:29,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.96 ms. Allocated memory is still 199.8 MB. Free memory was 155.1 MB in the beginning and 152.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:29,416 INFO L168 Benchmark]: Boogie Preprocessor took 60.10 ms. Allocated memory is still 199.8 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:29,417 INFO L168 Benchmark]: RCFGBuilder took 809.82 ms. Allocated memory is still 199.8 MB. Free memory was 149.9 MB in the beginning and 105.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:29,417 INFO L168 Benchmark]: TraceAbstraction took 18616.36 ms. Allocated memory was 199.8 MB in the beginning and 812.1 MB in the end (delta: 612.4 MB). Free memory was 105.0 MB in the beginning and 503.9 MB in the end (delta: -398.9 MB). Peak memory consumption was 213.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:29,427 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.24 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.16 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 98.7 MB in the beginning and 155.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.96 ms. Allocated memory is still 199.8 MB. Free memory was 155.1 MB in the beginning and 152.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.10 ms. Allocated memory is still 199.8 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.82 ms. Allocated memory is still 199.8 MB. Free memory was 149.9 MB in the beginning and 105.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18616.36 ms. Allocated memory was 199.8 MB in the beginning and 812.1 MB in the end (delta: 612.4 MB). Free memory was 105.0 MB in the beginning and 503.9 MB in the end (delta: -398.9 MB). Peak memory consumption was 213.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1459 SDtfs, 1666 SDslu, 4523 SDs, 0 SdLazy, 3596 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 9847 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 136585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...