/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:40:05,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:40:05,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:40:05,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:40:05,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:40:05,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:40:05,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:40:05,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:40:05,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:40:05,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:40:05,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:40:05,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:40:05,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:40:05,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:40:05,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:40:05,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:40:05,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:40:05,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:40:05,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:40:05,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:40:05,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:40:05,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:40:05,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:40:05,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:40:05,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:40:05,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:40:05,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:40:05,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:40:05,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:40:05,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:40:05,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:40:05,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:40:05,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:40:05,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:40:05,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:40:05,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:40:05,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:40:05,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:40:05,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:40:05,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:40:05,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:40:05,817 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:40:05,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:40:05,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:40:05,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:40:05,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:40:05,833 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:40:05,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:40:05,834 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:40:05,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:40:05,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:40:05,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:40:05,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:40:05,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:40:05,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:40:05,835 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:40:05,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:40:05,835 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:40:05,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:40:05,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:40:05,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:40:05,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:40:05,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:40:05,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:40:05,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:40:05,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:40:05,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:40:05,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:40:05,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:40:05,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:40:05,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:40:05,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:40:06,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:40:06,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:40:06,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:40:06,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:40:06,138 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:40:06,139 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-18 13:40:06,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de94e1341/c863849518d348feaffbbb8727fca64d/FLAG100b6643a [2019-12-18 13:40:06,788 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:40:06,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-18 13:40:06,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de94e1341/c863849518d348feaffbbb8727fca64d/FLAG100b6643a [2019-12-18 13:40:07,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de94e1341/c863849518d348feaffbbb8727fca64d [2019-12-18 13:40:07,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:40:07,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:40:07,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:40:07,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:40:07,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:40:07,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07, skipping insertion in model container [2019-12-18 13:40:07,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:40:07,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:40:07,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:40:07,707 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:40:07,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:40:07,897 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:40:07,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07 WrapperNode [2019-12-18 13:40:07,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:40:07,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:40:07,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:40:07,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:40:07,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:40:07,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:40:07,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:40:07,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:40:07,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:07,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:08,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... [2019-12-18 13:40:08,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:40:08,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:40:08,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:40:08,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:40:08,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:40:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:40:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:40:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:40:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:40:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:40:08,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:40:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:40:08,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:40:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:40:08,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:40:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:40:08,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:40:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:40:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:40:08,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:40:08,082 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:40:08,836 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:40:08,837 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:40:08,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:40:08 BoogieIcfgContainer [2019-12-18 13:40:08,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:40:08,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:40:08,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:40:08,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:40:08,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:40:07" (1/3) ... [2019-12-18 13:40:08,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2574c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:40:08, skipping insertion in model container [2019-12-18 13:40:08,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:07" (2/3) ... [2019-12-18 13:40:08,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2574c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:40:08, skipping insertion in model container [2019-12-18 13:40:08,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:40:08" (3/3) ... [2019-12-18 13:40:08,848 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2019-12-18 13:40:08,858 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:40:08,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:40:08,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:40:08,868 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:40:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,916 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,917 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,929 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,929 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,930 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,930 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,978 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,979 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,982 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,982 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,985 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,985 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,986 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:08,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:09,001 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:40:09,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:40:09,021 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:40:09,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:40:09,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:40:09,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:40:09,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:40:09,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:40:09,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:40:09,039 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 13:40:09,041 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 13:40:09,130 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 13:40:09,131 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:40:09,157 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:40:09,179 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 13:40:09,257 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 13:40:09,257 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:40:09,263 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:40:09,279 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:40:09,281 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:40:14,769 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 13:40:14,906 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 13:40:14,930 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-18 13:40:14,931 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 13:40:14,935 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:40:17,212 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-18 13:40:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-18 13:40:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:40:17,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:17,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:17,222 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:17,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-18 13:40:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:17,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140963819] [2019-12-18 13:40:17,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:17,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140963819] [2019-12-18 13:40:17,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:17,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:40:17,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004963852] [2019-12-18 13:40:17,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:17,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:17,530 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-18 13:40:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:18,857 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-18 13:40:18,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:18,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:40:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:19,165 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 13:40:19,165 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 13:40:19,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 13:40:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 13:40:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 13:40:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-18 13:40:21,273 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-18 13:40:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:21,275 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-18 13:40:21,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-18 13:40:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:40:21,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:21,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:21,288 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-18 13:40:21,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:21,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733646745] [2019-12-18 13:40:21,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:21,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733646745] [2019-12-18 13:40:21,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:21,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:21,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837162665] [2019-12-18 13:40:21,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:40:21,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:21,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:40:21,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:40:21,452 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-18 13:40:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:23,999 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-18 13:40:23,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:40:23,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:40:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:24,234 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 13:40:24,235 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 13:40:24,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 13:40:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-18 13:40:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-18 13:40:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-18 13:40:26,548 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-18 13:40:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:26,548 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-18 13:40:26,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:40:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-18 13:40:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:40:26,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:26,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:26,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:26,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:26,553 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-18 13:40:26,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:26,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221102670] [2019-12-18 13:40:26,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:26,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221102670] [2019-12-18 13:40:26,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:26,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:26,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414265200] [2019-12-18 13:40:26,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:26,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:26,634 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-18 13:40:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:26,820 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-18 13:40:26,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:26,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:40:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:26,943 INFO L225 Difference]: With dead ends: 40168 [2019-12-18 13:40:26,943 INFO L226 Difference]: Without dead ends: 40168 [2019-12-18 13:40:26,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-18 13:40:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-18 13:40:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-18 13:40:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-18 13:40:30,231 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-18 13:40:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:30,232 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-18 13:40:30,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-18 13:40:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:40:30,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:30,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:30,235 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-18 13:40:30,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:30,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118598467] [2019-12-18 13:40:30,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:30,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118598467] [2019-12-18 13:40:30,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:30,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:30,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141126262] [2019-12-18 13:40:30,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:40:30,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:30,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:40:30,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:40:30,295 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-18 13:40:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:30,392 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-18 13:40:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:40:30,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:40:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:30,417 INFO L225 Difference]: With dead ends: 16680 [2019-12-18 13:40:30,418 INFO L226 Difference]: Without dead ends: 16680 [2019-12-18 13:40:30,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:40:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-18 13:40:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-18 13:40:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-18 13:40:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-18 13:40:31,115 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-18 13:40:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:31,116 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-18 13:40:31,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:40:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-18 13:40:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:40:31,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:31,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:31,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-18 13:40:31,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:31,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306210230] [2019-12-18 13:40:31,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:31,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306210230] [2019-12-18 13:40:31,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:31,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:40:31,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310174060] [2019-12-18 13:40:31,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:40:31,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:40:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:31,173 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-18 13:40:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:31,221 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-18 13:40:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:40:31,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:40:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:31,226 INFO L225 Difference]: With dead ends: 2823 [2019-12-18 13:40:31,226 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 13:40:31,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 13:40:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-18 13:40:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-18 13:40:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-18 13:40:31,278 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-18 13:40:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:31,278 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-18 13:40:31,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:40:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-18 13:40:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:40:31,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:31,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:31,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-18 13:40:31,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:31,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139034545] [2019-12-18 13:40:31,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:31,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139034545] [2019-12-18 13:40:31,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:31,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:31,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724118119] [2019-12-18 13:40:31,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:31,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:31,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:31,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:31,358 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-18 13:40:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:31,407 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-18 13:40:31,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:40:31,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:40:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:31,410 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 13:40:31,411 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 13:40:31,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 13:40:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 13:40:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 13:40:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-18 13:40:31,434 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-18 13:40:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:31,434 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-18 13:40:31,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-18 13:40:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:31,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:31,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:31,439 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-18 13:40:31,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:31,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384193707] [2019-12-18 13:40:31,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:31,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384193707] [2019-12-18 13:40:31,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:31,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:31,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530901459] [2019-12-18 13:40:31,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:31,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:31,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:31,545 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-18 13:40:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:31,605 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-18 13:40:31,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:31,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:40:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:31,608 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:40:31,608 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:40:31,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:40:31,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 13:40:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 13:40:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-18 13:40:31,623 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-18 13:40:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:31,624 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-18 13:40:31,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-18 13:40:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:31,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:31,628 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-18 13:40:31,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:31,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36467016] [2019-12-18 13:40:31,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:31,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36467016] [2019-12-18 13:40:31,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:31,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:31,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362340312] [2019-12-18 13:40:31,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:31,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:31,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:31,700 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-18 13:40:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:31,746 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-18 13:40:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:31,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:40:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:31,748 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:40:31,748 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:40:31,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:40:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-18 13:40:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-18 13:40:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-18 13:40:31,766 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-18 13:40:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:31,767 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-18 13:40:31,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:31,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-18 13:40:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:31,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:31,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:31,771 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-18 13:40:31,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:31,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600946161] [2019-12-18 13:40:31,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:31,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600946161] [2019-12-18 13:40:31,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:31,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:31,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477848246] [2019-12-18 13:40:31,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:40:31,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:31,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:40:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:31,880 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-18 13:40:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:32,112 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-18 13:40:32,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:40:32,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 13:40:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:32,116 INFO L225 Difference]: With dead ends: 1764 [2019-12-18 13:40:32,116 INFO L226 Difference]: Without dead ends: 1764 [2019-12-18 13:40:32,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-18 13:40:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-18 13:40:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-18 13:40:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-18 13:40:32,142 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-18 13:40:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:32,142 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-18 13:40:32,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:40:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-18 13:40:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:32,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:32,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:32,147 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-18 13:40:32,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:32,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186090496] [2019-12-18 13:40:32,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:32,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186090496] [2019-12-18 13:40:32,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:32,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:40:32,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791007142] [2019-12-18 13:40:32,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:32,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:32,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:32,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:32,266 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-18 13:40:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:32,598 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-18 13:40:32,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:40:32,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:40:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:32,610 INFO L225 Difference]: With dead ends: 2370 [2019-12-18 13:40:32,610 INFO L226 Difference]: Without dead ends: 2370 [2019-12-18 13:40:32,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:40:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-18 13:40:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-18 13:40:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-18 13:40:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-18 13:40:32,631 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-18 13:40:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:32,631 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-18 13:40:32,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-18 13:40:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:32,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:32,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:32,636 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-18 13:40:32,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:32,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082577375] [2019-12-18 13:40:32,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:32,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082577375] [2019-12-18 13:40:32,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:32,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:40:32,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361714126] [2019-12-18 13:40:32,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:32,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:32,737 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 6 states. [2019-12-18 13:40:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:33,479 INFO L93 Difference]: Finished difference Result 2377 states and 6752 transitions. [2019-12-18 13:40:33,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:40:33,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:40:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:33,484 INFO L225 Difference]: With dead ends: 2377 [2019-12-18 13:40:33,484 INFO L226 Difference]: Without dead ends: 2377 [2019-12-18 13:40:33,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:40:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-18 13:40:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1691. [2019-12-18 13:40:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-18 13:40:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4860 transitions. [2019-12-18 13:40:33,515 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4860 transitions. Word has length 58 [2019-12-18 13:40:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:33,516 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4860 transitions. [2019-12-18 13:40:33,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4860 transitions. [2019-12-18 13:40:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:33,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:33,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:33,520 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:33,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:33,520 INFO L82 PathProgramCache]: Analyzing trace with hash -687244225, now seen corresponding path program 4 times [2019-12-18 13:40:33,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:33,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070599509] [2019-12-18 13:40:33,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:33,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070599509] [2019-12-18 13:40:33,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:33,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:40:33,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543909676] [2019-12-18 13:40:33,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:40:33,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:33,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:40:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:40:33,651 INFO L87 Difference]: Start difference. First operand 1691 states and 4860 transitions. Second operand 7 states. [2019-12-18 13:40:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:34,075 INFO L93 Difference]: Finished difference Result 2634 states and 7483 transitions. [2019-12-18 13:40:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:40:34,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 13:40:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:34,081 INFO L225 Difference]: With dead ends: 2634 [2019-12-18 13:40:34,081 INFO L226 Difference]: Without dead ends: 2634 [2019-12-18 13:40:34,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:40:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2019-12-18 13:40:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1607. [2019-12-18 13:40:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-18 13:40:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4612 transitions. [2019-12-18 13:40:34,106 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4612 transitions. Word has length 58 [2019-12-18 13:40:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:34,106 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 4612 transitions. [2019-12-18 13:40:34,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:40:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4612 transitions. [2019-12-18 13:40:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:40:34,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:34,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:34,111 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 658273713, now seen corresponding path program 1 times [2019-12-18 13:40:34,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:34,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623662560] [2019-12-18 13:40:34,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:34,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623662560] [2019-12-18 13:40:34,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:34,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:40:34,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397898922] [2019-12-18 13:40:34,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:40:34,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:34,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:40:34,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:40:34,283 INFO L87 Difference]: Start difference. First operand 1607 states and 4612 transitions. Second operand 7 states. [2019-12-18 13:40:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:34,445 INFO L93 Difference]: Finished difference Result 3238 states and 8703 transitions. [2019-12-18 13:40:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:40:34,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 13:40:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:34,450 INFO L225 Difference]: With dead ends: 3238 [2019-12-18 13:40:34,450 INFO L226 Difference]: Without dead ends: 2335 [2019-12-18 13:40:34,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:40:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-18 13:40:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1477. [2019-12-18 13:40:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-12-18 13:40:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 4172 transitions. [2019-12-18 13:40:34,473 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 4172 transitions. Word has length 59 [2019-12-18 13:40:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:34,473 INFO L462 AbstractCegarLoop]: Abstraction has 1477 states and 4172 transitions. [2019-12-18 13:40:34,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:40:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 4172 transitions. [2019-12-18 13:40:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:40:34,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:34,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:34,476 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:34,477 INFO L82 PathProgramCache]: Analyzing trace with hash 726022051, now seen corresponding path program 2 times [2019-12-18 13:40:34,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:34,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395829239] [2019-12-18 13:40:34,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:34,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395829239] [2019-12-18 13:40:34,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:34,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:34,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17890410] [2019-12-18 13:40:34,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:34,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:34,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:34,545 INFO L87 Difference]: Start difference. First operand 1477 states and 4172 transitions. Second operand 3 states. [2019-12-18 13:40:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:34,589 INFO L93 Difference]: Finished difference Result 1476 states and 4170 transitions. [2019-12-18 13:40:34,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:34,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:40:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:34,592 INFO L225 Difference]: With dead ends: 1476 [2019-12-18 13:40:34,592 INFO L226 Difference]: Without dead ends: 1476 [2019-12-18 13:40:34,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-12-18 13:40:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 951. [2019-12-18 13:40:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-18 13:40:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2688 transitions. [2019-12-18 13:40:34,610 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2688 transitions. Word has length 59 [2019-12-18 13:40:34,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:34,610 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2688 transitions. [2019-12-18 13:40:34,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2688 transitions. [2019-12-18 13:40:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:40:34,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:34,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:34,613 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1147587362, now seen corresponding path program 1 times [2019-12-18 13:40:34,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:34,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950307557] [2019-12-18 13:40:34,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:34,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950307557] [2019-12-18 13:40:34,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:34,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:34,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045418118] [2019-12-18 13:40:34,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:34,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:34,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:34,673 INFO L87 Difference]: Start difference. First operand 951 states and 2688 transitions. Second operand 3 states. [2019-12-18 13:40:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:34,689 INFO L93 Difference]: Finished difference Result 895 states and 2460 transitions. [2019-12-18 13:40:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:34,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:40:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:34,691 INFO L225 Difference]: With dead ends: 895 [2019-12-18 13:40:34,691 INFO L226 Difference]: Without dead ends: 895 [2019-12-18 13:40:34,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-12-18 13:40:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 831. [2019-12-18 13:40:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-18 13:40:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 2276 transitions. [2019-12-18 13:40:34,707 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 2276 transitions. Word has length 59 [2019-12-18 13:40:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:34,707 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 2276 transitions. [2019-12-18 13:40:34,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 2276 transitions. [2019-12-18 13:40:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:34,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:34,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:34,710 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 709050974, now seen corresponding path program 1 times [2019-12-18 13:40:34,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:34,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652919712] [2019-12-18 13:40:34,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:34,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652919712] [2019-12-18 13:40:34,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:34,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:40:34,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721552548] [2019-12-18 13:40:34,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:40:34,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:40:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:40:34,963 INFO L87 Difference]: Start difference. First operand 831 states and 2276 transitions. Second operand 13 states. [2019-12-18 13:40:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:35,917 INFO L93 Difference]: Finished difference Result 1931 states and 4713 transitions. [2019-12-18 13:40:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:40:35,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:40:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:35,919 INFO L225 Difference]: With dead ends: 1931 [2019-12-18 13:40:35,919 INFO L226 Difference]: Without dead ends: 820 [2019-12-18 13:40:35,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:40:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-18 13:40:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 605. [2019-12-18 13:40:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 13:40:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1453 transitions. [2019-12-18 13:40:35,927 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1453 transitions. Word has length 60 [2019-12-18 13:40:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:35,928 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1453 transitions. [2019-12-18 13:40:35,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:40:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1453 transitions. [2019-12-18 13:40:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:35,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:35,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:35,929 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1492443498, now seen corresponding path program 2 times [2019-12-18 13:40:35,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:35,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454641053] [2019-12-18 13:40:35,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:36,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454641053] [2019-12-18 13:40:36,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:36,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:40:36,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199451685] [2019-12-18 13:40:36,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:40:36,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:36,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:40:36,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:40:36,138 INFO L87 Difference]: Start difference. First operand 605 states and 1453 transitions. Second operand 12 states. [2019-12-18 13:40:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:36,518 INFO L93 Difference]: Finished difference Result 1134 states and 2748 transitions. [2019-12-18 13:40:36,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:40:36,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 13:40:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:36,520 INFO L225 Difference]: With dead ends: 1134 [2019-12-18 13:40:36,521 INFO L226 Difference]: Without dead ends: 1102 [2019-12-18 13:40:36,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:40:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-12-18 13:40:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 869. [2019-12-18 13:40:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-18 13:40:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2087 transitions. [2019-12-18 13:40:36,532 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2087 transitions. Word has length 60 [2019-12-18 13:40:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:36,532 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 2087 transitions. [2019-12-18 13:40:36,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:40:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2087 transitions. [2019-12-18 13:40:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:36,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:36,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:36,533 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1667445582, now seen corresponding path program 3 times [2019-12-18 13:40:36,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:36,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707583478] [2019-12-18 13:40:36,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:36,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707583478] [2019-12-18 13:40:36,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:36,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:36,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432488240] [2019-12-18 13:40:36,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:36,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:36,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:36,675 INFO L87 Difference]: Start difference. First operand 869 states and 2087 transitions. Second operand 6 states. [2019-12-18 13:40:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:36,756 INFO L93 Difference]: Finished difference Result 1155 states and 2679 transitions. [2019-12-18 13:40:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:40:36,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:40:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:36,757 INFO L225 Difference]: With dead ends: 1155 [2019-12-18 13:40:36,757 INFO L226 Difference]: Without dead ends: 261 [2019-12-18 13:40:36,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:40:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-18 13:40:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 237. [2019-12-18 13:40:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 13:40:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-18 13:40:36,761 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 60 [2019-12-18 13:40:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:36,761 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-18 13:40:36,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-18 13:40:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:36,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:36,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:36,762 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 4 times [2019-12-18 13:40:36,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:36,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570955756] [2019-12-18 13:40:36,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:37,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570955756] [2019-12-18 13:40:37,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:37,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:40:37,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147450031] [2019-12-18 13:40:37,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:40:37,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:40:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:40:37,004 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 13 states. [2019-12-18 13:40:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:37,525 INFO L93 Difference]: Finished difference Result 387 states and 656 transitions. [2019-12-18 13:40:37,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:40:37,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:40:37,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:37,527 INFO L225 Difference]: With dead ends: 387 [2019-12-18 13:40:37,527 INFO L226 Difference]: Without dead ends: 355 [2019-12-18 13:40:37,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:40:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-18 13:40:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 345. [2019-12-18 13:40:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 13:40:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-18 13:40:37,531 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-18 13:40:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:37,531 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-18 13:40:37,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:40:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-18 13:40:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:37,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:37,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:37,532 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 5 times [2019-12-18 13:40:37,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:37,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218140704] [2019-12-18 13:40:37,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:40:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:40:37,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:40:37,642 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:40:37,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_33) (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~x~0_30 0) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= v_~b~0_102 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= 0 |v_ULTIMATE.start_main_~#t1245~0.offset_16|) (= v_~z$r_buff0_thd0~0_435 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19|) |v_ULTIMATE.start_main_~#t1245~0.offset_16| 0)) |v_#memory_int_25|) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~y~0_50 0) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1245~0.base_19| 4)) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1245~0.base_19|) (= v_~z$r_buff0_thd1~0_87 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19| 1)) (= v_~z$w_buff1_used~0_620 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19|) 0) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ~a~0=v_~a~0_234, ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_22|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_21|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ULTIMATE.start_main_~#t1245~0.offset=|v_ULTIMATE.start_main_~#t1245~0.offset_16|, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t1245~0.base=|v_ULTIMATE.start_main_~#t1245~0.base_19|, ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_22|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_17|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ULTIMATE.start_main_~#t1246~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1246~0.base, ULTIMATE.start_main_~#t1247~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1245~0.offset, ~x~0, ULTIMATE.start_main_~#t1245~0.base, ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1247~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1248~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:40:37,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1246~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1246~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13|) |v_ULTIMATE.start_main_~#t1246~0.offset_11| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1246~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1246~0.base] because there is no mapped edge [2019-12-18 13:40:37,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1247~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1247~0.offset_10| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12|) |v_ULTIMATE.start_main_~#t1247~0.offset_10| 2)) |v_#memory_int_17|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1247~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1247~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1247~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1247~0.base] because there is no mapped edge [2019-12-18 13:40:37,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1248~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1248~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1248~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12|) |v_ULTIMATE.start_main_~#t1248~0.offset_10| 3)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1248~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 13:40:37,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 13:40:37,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~x~0_21 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_21, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:40:37,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_35 1) (= v_~x~0_26 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_35, ~x~0=v_~x~0_26, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:40:37,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In996029393 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In996029393 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In996029393 |P3Thread1of1ForFork3_#t~ite11_Out996029393|)) (and (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out996029393| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In996029393, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In996029393} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In996029393, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In996029393, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out996029393|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:40:37,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1861296082 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1861296082 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1861296082 |P2Thread1of1ForFork2_#t~ite3_Out-1861296082|)) (and (or .cse0 .cse1) (= ~z~0_In-1861296082 |P2Thread1of1ForFork2_#t~ite3_Out-1861296082|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1861296082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1861296082, ~z$w_buff1~0=~z$w_buff1~0_In-1861296082, ~z~0=~z~0_In-1861296082} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1861296082|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1861296082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1861296082, ~z$w_buff1~0=~z$w_buff1~0_In-1861296082, ~z~0=~z~0_In-1861296082} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:40:37,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-52580162 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-52580162 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-52580162 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-52580162 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-52580162 |P3Thread1of1ForFork3_#t~ite12_Out-52580162|)) (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-52580162|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-52580162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-52580162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-52580162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-52580162} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-52580162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-52580162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-52580162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-52580162, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-52580162|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:40:37,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In279189625 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In279189625 256) 0))) (or (and (= ~z$r_buff0_thd4~0_In279189625 ~z$r_buff0_thd4~0_Out279189625) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd4~0_Out279189625) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In279189625, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In279189625} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In279189625, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out279189625, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out279189625|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:40:37,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-197094433 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-197094433 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-197094433 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-197094433 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-197094433|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite14_Out-197094433| ~z$r_buff1_thd4~0_In-197094433)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-197094433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-197094433, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-197094433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-197094433} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-197094433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-197094433, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-197094433|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-197094433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-197094433} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:40:37,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:40:37,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:40:37,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In460041737 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In460041737 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out460041737| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out460041737| ~z$w_buff0_used~0_In460041737)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In460041737, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In460041737} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out460041737|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In460041737, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In460041737} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:40:37,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-96251289 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-96251289 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-96251289 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-96251289 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-96251289 |P2Thread1of1ForFork2_#t~ite6_Out-96251289|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-96251289|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-96251289, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-96251289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-96251289, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-96251289} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-96251289|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-96251289, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-96251289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-96251289, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-96251289} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:40:37,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In698568332 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In698568332 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out698568332| ~z$r_buff0_thd3~0_In698568332) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out698568332| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In698568332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In698568332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In698568332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In698568332, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out698568332|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:40:37,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1314655142 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1314655142 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1314655142 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1314655142 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out1314655142| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out1314655142| ~z$r_buff1_thd3~0_In1314655142) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1314655142, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1314655142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1314655142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1314655142} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1314655142, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1314655142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1314655142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1314655142, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1314655142|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:40:37,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:40:37,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 13:40:37,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1851931422 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1851931422 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1851931422 |ULTIMATE.start_main_#t~ite19_Out-1851931422|) (not .cse1)) (and (= ~z~0_In-1851931422 |ULTIMATE.start_main_#t~ite19_Out-1851931422|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1851931422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1851931422, ~z$w_buff1~0=~z$w_buff1~0_In-1851931422, ~z~0=~z~0_In-1851931422} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1851931422|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1851931422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1851931422, ~z$w_buff1~0=~z$w_buff1~0_In-1851931422, ~z~0=~z~0_In-1851931422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:40:37,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:40:37,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1966729816 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1966729816 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1966729816|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1966729816| ~z$w_buff0_used~0_In-1966729816) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1966729816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1966729816} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1966729816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1966729816, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1966729816|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:40:37,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1125696763 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1125696763 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1125696763 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1125696763 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1125696763|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1125696763 |ULTIMATE.start_main_#t~ite22_Out-1125696763|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1125696763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1125696763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1125696763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1125696763} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1125696763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1125696763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1125696763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1125696763, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1125696763|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:40:37,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1573413467 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1573413467 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out1573413467|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1573413467 |ULTIMATE.start_main_#t~ite23_Out1573413467|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1573413467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1573413467} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1573413467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1573413467, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1573413467|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:40:37,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-557952793 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-557952793 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-557952793 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-557952793 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out-557952793| ~z$r_buff1_thd0~0_In-557952793)) (and (= |ULTIMATE.start_main_#t~ite24_Out-557952793| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-557952793, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-557952793, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-557952793, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-557952793} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-557952793, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-557952793, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-557952793, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-557952793|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-557952793} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:40:37,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1075914530 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1075914530| |ULTIMATE.start_main_#t~ite39_Out-1075914530|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1075914530 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-1075914530 256) 0) (and (= (mod ~z$w_buff1_used~0_In-1075914530 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1075914530 256)) .cse0))) (= ~z$w_buff1_used~0_In-1075914530 |ULTIMATE.start_main_#t~ite39_Out-1075914530|) .cse1) (and (= |ULTIMATE.start_main_#t~ite39_In-1075914530| |ULTIMATE.start_main_#t~ite39_Out-1075914530|) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1075914530| ~z$w_buff1_used~0_In-1075914530)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1075914530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1075914530, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1075914530|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1075914530, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1075914530, ~weak$$choice2~0=~weak$$choice2~0_In-1075914530} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1075914530, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1075914530|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1075914530|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1075914530, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1075914530, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1075914530, ~weak$$choice2~0=~weak$$choice2~0_In-1075914530} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:40:37,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:40:37,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In133497931 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In133497931 |ULTIMATE.start_main_#t~ite46_Out133497931|) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In133497931| |ULTIMATE.start_main_#t~ite45_Out133497931|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite46_Out133497931| |ULTIMATE.start_main_#t~ite45_Out133497931|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In133497931 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In133497931 256)) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In133497931 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In133497931 256) 0))) (= ~z$r_buff1_thd0~0_In133497931 |ULTIMATE.start_main_#t~ite45_Out133497931|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In133497931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In133497931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In133497931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In133497931, ~weak$$choice2~0=~weak$$choice2~0_In133497931, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In133497931|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In133497931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In133497931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In133497931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In133497931, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out133497931|, ~weak$$choice2~0=~weak$$choice2~0_In133497931, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out133497931|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:40:37,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:40:37,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:40:37,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:40:37 BasicIcfg [2019-12-18 13:40:37,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:40:37,839 INFO L168 Benchmark]: Toolchain (without parser) took 30784.11 ms. Allocated memory was 137.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 100.3 MB in the beginning and 974.1 MB in the end (delta: -873.8 MB). Peak memory consumption was 357.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:37,840 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:40:37,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.19 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.9 MB in the beginning and 153.9 MB in the end (delta: -54.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:37,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.39 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 150.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:37,846 INFO L168 Benchmark]: Boogie Preprocessor took 37.36 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:37,846 INFO L168 Benchmark]: RCFGBuilder took 830.82 ms. Allocated memory is still 202.4 MB. Free memory was 147.7 MB in the beginning and 98.5 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:37,847 INFO L168 Benchmark]: TraceAbstraction took 28994.73 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 98.5 MB in the beginning and 974.1 MB in the end (delta: -875.6 MB). Peak memory consumption was 291.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:37,861 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.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.19 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.9 MB in the beginning and 153.9 MB in the end (delta: -54.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.39 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 150.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.36 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.82 ms. Allocated memory is still 202.4 MB. Free memory was 147.7 MB in the beginning and 98.5 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28994.73 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 98.5 MB in the beginning and 974.1 MB in the end (delta: -875.6 MB). Peak memory consumption was 291.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2195 SDtfs, 2438 SDslu, 5948 SDs, 0 SdLazy, 2802 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 40 SyntacticMatches, 14 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 9889 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 926 NumberOfCodeBlocks, 926 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 847 ConstructedInterpolants, 0 QuantifiedInterpolants, 182146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...