/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:52:29,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:52:29,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:52:29,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:52:29,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:52:29,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:52:29,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:52:29,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:52:29,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:52:29,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:52:29,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:52:29,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:52:29,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:52:29,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:52:29,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:52:29,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:52:29,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:52:29,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:52:29,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:52:29,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:52:29,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:52:29,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:52:29,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:52:29,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:52:29,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:52:29,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:52:29,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:52:29,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:52:29,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:52:29,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:52:29,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:52:29,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:52:29,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:52:29,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:52:29,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:52:29,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:52:29,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:52:29,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:52:29,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:52:29,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:52:29,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:52:29,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:52:29,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:52:29,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:52:29,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:52:29,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:52:29,849 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:52:29,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:52:29,850 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:52:29,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:52:29,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:52:29,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:52:29,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:52:29,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:52:29,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:52:29,853 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:52:29,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:52:29,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:52:29,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:52:29,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:52:29,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:52:29,854 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:52:29,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:52:29,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:52:29,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:52:29,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:52:29,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:52:29,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:52:29,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:52:29,856 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:52:29,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:52:29,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:52:30,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:52:30,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:52:30,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:52:30,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:52:30,175 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:52:30,177 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-18 21:52:30,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef7538c2/e00ab5b7145c44bd8f621a5ccadbda9e/FLAGb4c30fa5c [2019-12-18 21:52:30,801 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:52:30,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-18 21:52:30,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef7538c2/e00ab5b7145c44bd8f621a5ccadbda9e/FLAGb4c30fa5c [2019-12-18 21:52:31,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef7538c2/e00ab5b7145c44bd8f621a5ccadbda9e [2019-12-18 21:52:31,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:52:31,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:52:31,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:52:31,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:52:31,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:52:31,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:31,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156a7fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31, skipping insertion in model container [2019-12-18 21:52:31,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:31,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:52:31,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:52:31,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:52:31,812 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:52:31,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:52:31,973 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:52:31,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31 WrapperNode [2019-12-18 21:52:31,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:52:31,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:52:31,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:52:31,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:52:31,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:52:32,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:52:32,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:52:32,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:52:32,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (1/1) ... [2019-12-18 21:52:32,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:52:32,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:52:32,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:52:32,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:52:32,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (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 21:52:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:52:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:52:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:52:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:52:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:52:32,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:52:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:52:32,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:52:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:52:32,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:52:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:52:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:52:32,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:52:32,162 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 21:52:32,870 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:52:32,870 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:52:32,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:52:32 BoogieIcfgContainer [2019-12-18 21:52:32,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:52:32,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:52:32,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:52:32,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:52:32,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:52:31" (1/3) ... [2019-12-18 21:52:32,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8b1f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:52:32, skipping insertion in model container [2019-12-18 21:52:32,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:31" (2/3) ... [2019-12-18 21:52:32,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8b1f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:52:32, skipping insertion in model container [2019-12-18 21:52:32,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:52:32" (3/3) ... [2019-12-18 21:52:32,881 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2019-12-18 21:52:32,892 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:52:32,893 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:52:32,900 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:52:32,902 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:52:32,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,951 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,951 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,962 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,964 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,968 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,968 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:33,014 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:52:33,032 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:52:33,032 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:52:33,032 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:52:33,032 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:52:33,033 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:52:33,033 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:52:33,033 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:52:33,033 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:52:33,050 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 21:52:33,053 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 21:52:33,150 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 21:52:33,150 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:52:33,164 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:52:33,184 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 21:52:33,225 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 21:52:33,225 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:52:33,231 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:52:33,245 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:52:33,247 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:52:36,533 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 21:52:36,652 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51676 [2019-12-18 21:52:36,652 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 21:52:36,655 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 97 transitions [2019-12-18 21:52:37,733 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18542 states. [2019-12-18 21:52:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states. [2019-12-18 21:52:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:52:37,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:37,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:37,742 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1984617832, now seen corresponding path program 1 times [2019-12-18 21:52:37,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:37,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548689748] [2019-12-18 21:52:37,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:37,994 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 21:52:37,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548689748] [2019-12-18 21:52:37,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:37,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:52:37,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660350541] [2019-12-18 21:52:38,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:38,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:38,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:38,019 INFO L87 Difference]: Start difference. First operand 18542 states. Second operand 3 states. [2019-12-18 21:52:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:38,518 INFO L93 Difference]: Finished difference Result 18414 states and 69758 transitions. [2019-12-18 21:52:38,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:38,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:52:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:38,685 INFO L225 Difference]: With dead ends: 18414 [2019-12-18 21:52:38,685 INFO L226 Difference]: Without dead ends: 18050 [2019-12-18 21:52:38,687 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 21:52:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18050 states. [2019-12-18 21:52:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18050 to 18050. [2019-12-18 21:52:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-18 21:52:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 68456 transitions. [2019-12-18 21:52:40,106 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 68456 transitions. Word has length 7 [2019-12-18 21:52:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:40,108 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 68456 transitions. [2019-12-18 21:52:40,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 68456 transitions. [2019-12-18 21:52:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:52:40,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:40,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:40,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:40,114 INFO L82 PathProgramCache]: Analyzing trace with hash -975860123, now seen corresponding path program 1 times [2019-12-18 21:52:40,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:40,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480930679] [2019-12-18 21:52:40,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:40,226 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 21:52:40,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480930679] [2019-12-18 21:52:40,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:40,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:40,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935885687] [2019-12-18 21:52:40,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:52:40,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:52:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:52:40,232 INFO L87 Difference]: Start difference. First operand 18050 states and 68456 transitions. Second operand 4 states. [2019-12-18 21:52:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:41,049 INFO L93 Difference]: Finished difference Result 28066 states and 102408 transitions. [2019-12-18 21:52:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:52:41,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:52:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:41,173 INFO L225 Difference]: With dead ends: 28066 [2019-12-18 21:52:41,173 INFO L226 Difference]: Without dead ends: 28052 [2019-12-18 21:52:41,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2019-12-18 21:52:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 25418. [2019-12-18 21:52:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25418 states. [2019-12-18 21:52:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25418 states to 25418 states and 94124 transitions. [2019-12-18 21:52:42,237 INFO L78 Accepts]: Start accepts. Automaton has 25418 states and 94124 transitions. Word has length 13 [2019-12-18 21:52:42,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:42,238 INFO L462 AbstractCegarLoop]: Abstraction has 25418 states and 94124 transitions. [2019-12-18 21:52:42,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:52:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 25418 states and 94124 transitions. [2019-12-18 21:52:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:52:42,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:42,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:42,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:42,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash -595379205, now seen corresponding path program 1 times [2019-12-18 21:52:42,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:42,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201979965] [2019-12-18 21:52:42,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:42,338 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 21:52:42,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201979965] [2019-12-18 21:52:42,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:42,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:42,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220516032] [2019-12-18 21:52:42,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:42,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:42,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:42,341 INFO L87 Difference]: Start difference. First operand 25418 states and 94124 transitions. Second operand 3 states. [2019-12-18 21:52:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:42,496 INFO L93 Difference]: Finished difference Result 14452 states and 46370 transitions. [2019-12-18 21:52:42,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:42,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:52:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:43,497 INFO L225 Difference]: With dead ends: 14452 [2019-12-18 21:52:43,497 INFO L226 Difference]: Without dead ends: 14452 [2019-12-18 21:52:43,498 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 21:52:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2019-12-18 21:52:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14452. [2019-12-18 21:52:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-12-18 21:52:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 46370 transitions. [2019-12-18 21:52:43,856 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 46370 transitions. Word has length 13 [2019-12-18 21:52:43,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:43,859 INFO L462 AbstractCegarLoop]: Abstraction has 14452 states and 46370 transitions. [2019-12-18 21:52:43,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 46370 transitions. [2019-12-18 21:52:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:52:43,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:43,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:43,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1512112924, now seen corresponding path program 1 times [2019-12-18 21:52:43,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:43,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410830686] [2019-12-18 21:52:43,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:43,930 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 21:52:43,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410830686] [2019-12-18 21:52:43,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:43,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:52:43,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574628309] [2019-12-18 21:52:43,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:52:43,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:52:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:52:43,934 INFO L87 Difference]: Start difference. First operand 14452 states and 46370 transitions. Second operand 4 states. [2019-12-18 21:52:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:43,962 INFO L93 Difference]: Finished difference Result 2114 states and 4969 transitions. [2019-12-18 21:52:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:52:43,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:52:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:43,968 INFO L225 Difference]: With dead ends: 2114 [2019-12-18 21:52:43,968 INFO L226 Difference]: Without dead ends: 2114 [2019-12-18 21:52:43,968 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 21:52:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-12-18 21:52:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2019-12-18 21:52:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-18 21:52:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 4969 transitions. [2019-12-18 21:52:44,005 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 4969 transitions. Word has length 14 [2019-12-18 21:52:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:44,005 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 4969 transitions. [2019-12-18 21:52:44,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:52:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 4969 transitions. [2019-12-18 21:52:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:52:44,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:44,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:44,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:44,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:44,009 INFO L82 PathProgramCache]: Analyzing trace with hash 107168072, now seen corresponding path program 1 times [2019-12-18 21:52:44,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:44,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263601559] [2019-12-18 21:52:44,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:44,107 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 21:52:44,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263601559] [2019-12-18 21:52:44,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:44,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:52:44,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296347955] [2019-12-18 21:52:44,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:52:44,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:44,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:52:44,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:44,110 INFO L87 Difference]: Start difference. First operand 2114 states and 4969 transitions. Second operand 5 states. [2019-12-18 21:52:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:44,140 INFO L93 Difference]: Finished difference Result 699 states and 1627 transitions. [2019-12-18 21:52:44,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:52:44,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:52:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:44,142 INFO L225 Difference]: With dead ends: 699 [2019-12-18 21:52:44,143 INFO L226 Difference]: Without dead ends: 655 [2019-12-18 21:52:44,143 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 21:52:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-18 21:52:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 599. [2019-12-18 21:52:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-18 21:52:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1405 transitions. [2019-12-18 21:52:44,157 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1405 transitions. Word has length 26 [2019-12-18 21:52:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:44,157 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1405 transitions. [2019-12-18 21:52:44,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:52:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1405 transitions. [2019-12-18 21:52:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:44,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:44,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:44,163 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 523730057, now seen corresponding path program 1 times [2019-12-18 21:52:44,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:44,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804579678] [2019-12-18 21:52:44,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:44,301 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 21:52:44,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804579678] [2019-12-18 21:52:44,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:44,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:52:44,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534722849] [2019-12-18 21:52:44,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:44,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:44,305 INFO L87 Difference]: Start difference. First operand 599 states and 1405 transitions. Second operand 3 states. [2019-12-18 21:52:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:44,349 INFO L93 Difference]: Finished difference Result 609 states and 1420 transitions. [2019-12-18 21:52:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:44,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:52:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:44,353 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:52:44,354 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:52:44,354 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 21:52:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:52:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:52:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:52:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1416 transitions. [2019-12-18 21:52:44,364 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1416 transitions. Word has length 55 [2019-12-18 21:52:44,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:44,365 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1416 transitions. [2019-12-18 21:52:44,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1416 transitions. [2019-12-18 21:52:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:44,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:44,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:44,367 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894421, now seen corresponding path program 1 times [2019-12-18 21:52:44,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:44,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355103475] [2019-12-18 21:52:44,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:44,489 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 21:52:44,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355103475] [2019-12-18 21:52:44,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:44,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:52:44,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680848597] [2019-12-18 21:52:44,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:52:44,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:44,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:52:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:44,492 INFO L87 Difference]: Start difference. First operand 605 states and 1416 transitions. Second operand 5 states. [2019-12-18 21:52:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:44,714 INFO L93 Difference]: Finished difference Result 894 states and 2088 transitions. [2019-12-18 21:52:44,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:52:44,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:52:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:44,718 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:52:44,718 INFO L226 Difference]: Without dead ends: 894 [2019-12-18 21:52:44,719 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 21:52:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-18 21:52:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-18 21:52:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-18 21:52:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1697 transitions. [2019-12-18 21:52:44,732 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1697 transitions. Word has length 55 [2019-12-18 21:52:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:44,733 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1697 transitions. [2019-12-18 21:52:44,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:52:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1697 transitions. [2019-12-18 21:52:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:44,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:44,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:44,736 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1931223363, now seen corresponding path program 2 times [2019-12-18 21:52:44,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:44,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081910454] [2019-12-18 21:52:44,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:44,889 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 21:52:44,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081910454] [2019-12-18 21:52:44,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:44,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:52:44,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160188682] [2019-12-18 21:52:44,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:52:44,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:44,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:52:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:52:44,891 INFO L87 Difference]: Start difference. First operand 719 states and 1697 transitions. Second operand 6 states. [2019-12-18 21:52:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:45,287 INFO L93 Difference]: Finished difference Result 1193 states and 2783 transitions. [2019-12-18 21:52:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:52:45,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 21:52:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:45,292 INFO L225 Difference]: With dead ends: 1193 [2019-12-18 21:52:45,292 INFO L226 Difference]: Without dead ends: 1193 [2019-12-18 21:52:45,292 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 21:52:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-18 21:52:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 761. [2019-12-18 21:52:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-18 21:52:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1800 transitions. [2019-12-18 21:52:45,306 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1800 transitions. Word has length 55 [2019-12-18 21:52:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:45,306 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1800 transitions. [2019-12-18 21:52:45,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:52:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1800 transitions. [2019-12-18 21:52:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:45,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:45,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:45,309 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:45,310 INFO L82 PathProgramCache]: Analyzing trace with hash 891728533, now seen corresponding path program 3 times [2019-12-18 21:52:45,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:45,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575309178] [2019-12-18 21:52:45,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:45,458 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 21:52:45,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575309178] [2019-12-18 21:52:45,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:45,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:52:45,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703395642] [2019-12-18 21:52:45,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:52:45,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:45,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:52:45,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:52:45,462 INFO L87 Difference]: Start difference. First operand 761 states and 1800 transitions. Second operand 6 states. [2019-12-18 21:52:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:45,792 INFO L93 Difference]: Finished difference Result 1187 states and 2772 transitions. [2019-12-18 21:52:45,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:52:45,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 21:52:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:45,794 INFO L225 Difference]: With dead ends: 1187 [2019-12-18 21:52:45,794 INFO L226 Difference]: Without dead ends: 1187 [2019-12-18 21:52:45,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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 21:52:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-12-18 21:52:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 841. [2019-12-18 21:52:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-18 21:52:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1992 transitions. [2019-12-18 21:52:45,810 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1992 transitions. Word has length 55 [2019-12-18 21:52:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:45,810 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1992 transitions. [2019-12-18 21:52:45,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:52:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1992 transitions. [2019-12-18 21:52:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:45,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:45,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:45,814 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash 882034857, now seen corresponding path program 4 times [2019-12-18 21:52:45,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:45,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458273510] [2019-12-18 21:52:45,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:45,871 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 21:52:45,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458273510] [2019-12-18 21:52:45,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:45,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:45,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378920476] [2019-12-18 21:52:45,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:45,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:45,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:45,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:45,874 INFO L87 Difference]: Start difference. First operand 841 states and 1992 transitions. Second operand 3 states. [2019-12-18 21:52:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:45,894 INFO L93 Difference]: Finished difference Result 739 states and 1709 transitions. [2019-12-18 21:52:45,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:45,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:52:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:45,896 INFO L225 Difference]: With dead ends: 739 [2019-12-18 21:52:45,896 INFO L226 Difference]: Without dead ends: 739 [2019-12-18 21:52:45,897 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 21:52:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-12-18 21:52:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-12-18 21:52:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-12-18 21:52:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1709 transitions. [2019-12-18 21:52:45,910 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1709 transitions. Word has length 55 [2019-12-18 21:52:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:45,911 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1709 transitions. [2019-12-18 21:52:45,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1709 transitions. [2019-12-18 21:52:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:52:45,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:45,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:45,914 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:45,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1867905542, now seen corresponding path program 1 times [2019-12-18 21:52:45,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:45,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292819386] [2019-12-18 21:52:45,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:45,981 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 21:52:45,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292819386] [2019-12-18 21:52:45,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:45,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:45,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927984701] [2019-12-18 21:52:45,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:45,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:45,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:45,983 INFO L87 Difference]: Start difference. First operand 739 states and 1709 transitions. Second operand 3 states. [2019-12-18 21:52:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:46,026 INFO L93 Difference]: Finished difference Result 738 states and 1707 transitions. [2019-12-18 21:52:46,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:46,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:52:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:46,027 INFO L225 Difference]: With dead ends: 738 [2019-12-18 21:52:46,027 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 21:52:46,028 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 21:52:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 21:52:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 475. [2019-12-18 21:52:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-18 21:52:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1096 transitions. [2019-12-18 21:52:46,036 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1096 transitions. Word has length 56 [2019-12-18 21:52:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:46,036 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1096 transitions. [2019-12-18 21:52:46,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1096 transitions. [2019-12-18 21:52:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:52:46,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:46,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:46,038 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1825683623, now seen corresponding path program 1 times [2019-12-18 21:52:46,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:46,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213007900] [2019-12-18 21:52:46,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:46,164 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 21:52:46,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213007900] [2019-12-18 21:52:46,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:46,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:52:46,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287221230] [2019-12-18 21:52:46,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:52:46,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:46,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:52:46,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:46,166 INFO L87 Difference]: Start difference. First operand 475 states and 1096 transitions. Second operand 5 states. [2019-12-18 21:52:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:46,212 INFO L93 Difference]: Finished difference Result 717 states and 1536 transitions. [2019-12-18 21:52:46,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:52:46,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 21:52:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:46,214 INFO L225 Difference]: With dead ends: 717 [2019-12-18 21:52:46,214 INFO L226 Difference]: Without dead ends: 279 [2019-12-18 21:52:46,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:52:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-18 21:52:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2019-12-18 21:52:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-18 21:52:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 509 transitions. [2019-12-18 21:52:46,220 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 509 transitions. Word has length 57 [2019-12-18 21:52:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:46,220 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 509 transitions. [2019-12-18 21:52:46,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:52:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 509 transitions. [2019-12-18 21:52:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:52:46,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:46,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:46,222 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:46,222 INFO L82 PathProgramCache]: Analyzing trace with hash 543693155, now seen corresponding path program 2 times [2019-12-18 21:52:46,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:46,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286994120] [2019-12-18 21:52:46,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:46,483 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 21:52:46,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286994120] [2019-12-18 21:52:46,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:46,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:52:46,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808016635] [2019-12-18 21:52:46,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:52:46,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:46,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:52:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:52:46,486 INFO L87 Difference]: Start difference. First operand 279 states and 509 transitions. Second operand 13 states. [2019-12-18 21:52:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:47,081 INFO L93 Difference]: Finished difference Result 493 states and 880 transitions. [2019-12-18 21:52:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:52:47,082 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:52:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:47,083 INFO L225 Difference]: With dead ends: 493 [2019-12-18 21:52:47,083 INFO L226 Difference]: Without dead ends: 461 [2019-12-18 21:52:47,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:52:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-12-18 21:52:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 379. [2019-12-18 21:52:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 21:52:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 680 transitions. [2019-12-18 21:52:47,089 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 680 transitions. Word has length 57 [2019-12-18 21:52:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:47,090 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 680 transitions. [2019-12-18 21:52:47,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:52:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 680 transitions. [2019-12-18 21:52:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:52:47,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:47,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:47,091 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1607584303, now seen corresponding path program 3 times [2019-12-18 21:52:47,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:47,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478882852] [2019-12-18 21:52:47,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:47,577 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 21:52:47,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478882852] [2019-12-18 21:52:47,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:47,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 21:52:47,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76462179] [2019-12-18 21:52:47,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 21:52:47,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:47,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 21:52:47,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:52:47,579 INFO L87 Difference]: Start difference. First operand 379 states and 680 transitions. Second operand 19 states. [2019-12-18 21:52:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:49,019 INFO L93 Difference]: Finished difference Result 948 states and 1665 transitions. [2019-12-18 21:52:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:52:49,020 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-18 21:52:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:49,021 INFO L225 Difference]: With dead ends: 948 [2019-12-18 21:52:49,022 INFO L226 Difference]: Without dead ends: 916 [2019-12-18 21:52:49,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 21:52:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2019-12-18 21:52:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 413. [2019-12-18 21:52:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-18 21:52:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 744 transitions. [2019-12-18 21:52:49,030 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 744 transitions. Word has length 57 [2019-12-18 21:52:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:49,030 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 744 transitions. [2019-12-18 21:52:49,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 21:52:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 744 transitions. [2019-12-18 21:52:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:52:49,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:49,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:49,032 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1879148695, now seen corresponding path program 4 times [2019-12-18 21:52:49,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:49,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047114029] [2019-12-18 21:52:49,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:52:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:52:49,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:52:49,129 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:52:49,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_45) (= v_~y~0_25 0) (= v_~y$r_buff0_thd1~0_8 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1492~0.base_27| 4) |v_#length_25|) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd3~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_27|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1492~0.base_27|) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t1492~0.offset_20|) (= v_~x~0_12 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$r_buff1_thd2~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_27| 1) |v_#valid_64|) (= v_~y$w_buff1_used~0_63 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1492~0.base_27| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1492~0.base_27|) |v_ULTIMATE.start_main_~#t1492~0.offset_20| 0)) |v_#memory_int_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_20|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_27|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t1492~0.offset=|v_ULTIMATE.start_main_~#t1492~0.offset_20|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_~#t1492~0.base=|v_ULTIMATE.start_main_~#t1492~0.base_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1493~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t1494~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1494~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1493~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1492~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1492~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:52:49,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L800-1-->L802: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1493~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1493~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1493~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13|) |v_ULTIMATE.start_main_~#t1493~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_11|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1493~0.offset, ULTIMATE.start_main_~#t1493~0.base] because there is no mapped edge [2019-12-18 21:52:49,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1494~0.offset_10|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1494~0.base_12|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12| 1) |v_#valid_38|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12|) |v_ULTIMATE.start_main_~#t1494~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1494~0.offset, ULTIMATE.start_main_~#t1494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:52:49,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_79) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= (mod v_~y$w_buff1_used~0_51 256) 0) (= v_~y$w_buff1_used~0_51 v_~y$w_buff0_used~0_80) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_16) (= 2 v_~y$w_buff0~0_15) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:52:49,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:52:49,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In457015303 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In457015303 256)))) (or (and (= ~y$w_buff0_used~0_In457015303 |P2Thread1of1ForFork0_#t~ite11_Out457015303|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out457015303|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In457015303, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In457015303} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In457015303, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out457015303|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In457015303} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 21:52:49,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In633598755 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In633598755 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In633598755 |P1Thread1of1ForFork2_#t~ite3_Out633598755|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In633598755 |P1Thread1of1ForFork2_#t~ite3_Out633598755|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In633598755, ~y$w_buff1~0=~y$w_buff1~0_In633598755, ~y~0=~y~0_In633598755, ~y$w_buff1_used~0=~y$w_buff1_used~0_In633598755} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In633598755, ~y$w_buff1~0=~y$w_buff1~0_In633598755, ~y~0=~y~0_In633598755, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out633598755|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In633598755} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:52:49,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:52:49,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In278737092 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In278737092 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out278737092|)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out278737092| ~y$w_buff0_used~0_In278737092) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In278737092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In278737092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In278737092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In278737092, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out278737092|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:52:49,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-347453130 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-347453130 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-347453130 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-347453130 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-347453130|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-347453130 |P1Thread1of1ForFork2_#t~ite6_Out-347453130|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-347453130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-347453130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-347453130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-347453130} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-347453130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-347453130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-347453130, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-347453130|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-347453130} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:52:49,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-329018644 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-329018644 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-329018644|)) (and (= ~y$r_buff0_thd2~0_In-329018644 |P1Thread1of1ForFork2_#t~ite7_Out-329018644|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-329018644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-329018644} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-329018644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-329018644, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-329018644|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:52:49,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1817676688 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1817676688 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1817676688 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1817676688 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1817676688|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1817676688 |P2Thread1of1ForFork0_#t~ite12_Out1817676688|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1817676688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1817676688, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1817676688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1817676688} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1817676688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1817676688, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1817676688|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1817676688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1817676688} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:52:49,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In840317131 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In840317131 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In840317131 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In840317131 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out840317131| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite8_Out840317131| ~y$r_buff1_thd2~0_In840317131) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In840317131, ~y$w_buff0_used~0=~y$w_buff0_used~0_In840317131, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In840317131, ~y$w_buff1_used~0=~y$w_buff1_used~0_In840317131} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In840317131, ~y$w_buff0_used~0=~y$w_buff0_used~0_In840317131, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out840317131|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In840317131, ~y$w_buff1_used~0=~y$w_buff1_used~0_In840317131} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:52:49,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L752-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:52:49,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In197608693 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In197608693 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In197608693 ~y$r_buff0_thd3~0_Out197608693)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out197608693)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In197608693, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In197608693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In197608693, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out197608693, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out197608693|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 21:52:49,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1637383154 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1637383154 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1637383154 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1637383154 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-1637383154| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite14_Out-1637383154| ~y$r_buff1_thd3~0_In-1637383154) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1637383154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1637383154, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1637383154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1637383154} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1637383154|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1637383154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1637383154, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1637383154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1637383154} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:52:49,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork0_#t~ite14_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:52:49,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:52:49,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In241244252 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In241244252 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out241244252| ~y$w_buff1~0_In241244252) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite18_Out241244252| ~y~0_In241244252) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In241244252, ~y~0=~y~0_In241244252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In241244252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In241244252} OutVars{~y$w_buff1~0=~y$w_buff1~0_In241244252, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out241244252|, ~y~0=~y~0_In241244252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In241244252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In241244252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 21:52:49,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite18_7|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-18 21:52:49,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1765850689 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1765850689 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-1765850689| ~y$w_buff0_used~0_In-1765850689) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-1765850689| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1765850689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1765850689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1765850689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1765850689, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1765850689|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:52:49,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In25421767 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In25421767 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In25421767 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In25421767 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out25421767| ~y$w_buff1_used~0_In25421767) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite21_Out25421767| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In25421767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In25421767, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In25421767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In25421767} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In25421767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In25421767, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out25421767|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In25421767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In25421767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:52:49,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In810941880 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In810941880 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out810941880|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out810941880| ~y$r_buff0_thd0~0_In810941880) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In810941880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In810941880} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In810941880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In810941880, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out810941880|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:52:49,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1180380760 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1180380760 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1180380760 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1180380760 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-1180380760| ~y$r_buff1_thd0~0_In-1180380760) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-1180380760| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1180380760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1180380760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1180380760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1180380760} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1180380760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1180380760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1180380760, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1180380760|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1180380760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:52:49,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1658887981 256)))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out1658887981| |ULTIMATE.start_main_#t~ite29_Out1658887981|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1658887981 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1658887981 256))) (= 0 (mod ~y$w_buff0_used~0_In1658887981 256)) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In1658887981 256) 0)))) .cse1 (= ~y$w_buff0~0_In1658887981 |ULTIMATE.start_main_#t~ite29_Out1658887981|)) (and (= |ULTIMATE.start_main_#t~ite29_In1658887981| |ULTIMATE.start_main_#t~ite29_Out1658887981|) (= |ULTIMATE.start_main_#t~ite30_Out1658887981| ~y$w_buff0~0_In1658887981) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1658887981, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1658887981|, ~y$w_buff0~0=~y$w_buff0~0_In1658887981, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1658887981, ~weak$$choice2~0=~weak$$choice2~0_In1658887981, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1658887981, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658887981} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1658887981|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658887981, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1658887981|, ~y$w_buff0~0=~y$w_buff0~0_In1658887981, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1658887981, ~weak$$choice2~0=~weak$$choice2~0_In1658887981, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1658887981, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658887981} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 21:52:49,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:52:49,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:52:49,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:52:49,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:52:49 BasicIcfg [2019-12-18 21:52:49,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:52:49,233 INFO L168 Benchmark]: Toolchain (without parser) took 18095.71 ms. Allocated memory was 145.2 MB in the beginning and 872.4 MB in the end (delta: 727.2 MB). Free memory was 101.0 MB in the beginning and 364.2 MB in the end (delta: -263.2 MB). Peak memory consumption was 463.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:49,234 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:52:49,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.48 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 155.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:49,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.88 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:49,236 INFO L168 Benchmark]: Boogie Preprocessor took 43.39 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:49,236 INFO L168 Benchmark]: RCFGBuilder took 785.45 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 104.0 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:49,237 INFO L168 Benchmark]: TraceAbstraction took 16358.25 ms. Allocated memory was 202.4 MB in the beginning and 872.4 MB in the end (delta: 670.0 MB). Free memory was 104.0 MB in the beginning and 364.2 MB in the end (delta: -260.3 MB). Peak memory consumption was 409.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:49,241 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.48 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 155.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.88 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.39 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.45 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 104.0 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16358.25 ms. Allocated memory was 202.4 MB in the beginning and 872.4 MB in the end (delta: 670.0 MB). Free memory was 104.0 MB in the beginning and 364.2 MB in the end (delta: -260.3 MB). Peak memory consumption was 409.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 162 ProgramPointsBefore, 86 ProgramPointsAfterwards, 193 TransitionsBefore, 97 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 24 ChoiceCompositions, 3760 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51676 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1463 SDtfs, 1413 SDslu, 3458 SDs, 0 SdLazy, 2510 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25418occurred 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: 2.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4495 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 95827 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...