/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:38:39,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:38:39,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:38:39,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:38:39,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:38:39,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:38:39,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:38:39,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:38:39,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:38:39,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:38:39,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:38:39,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:38:39,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:38:39,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:38:39,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:38:39,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:38:39,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:38:39,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:38:39,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:38:39,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:38:39,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:38:39,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:38:39,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:38:39,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:38:39,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:38:39,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:38:39,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:38:39,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:38:39,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:38:39,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:38:39,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:38:39,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:38:39,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:38:39,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:38:39,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:38:39,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:38:39,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:38:39,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:38:39,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:38:39,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:38:39,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:38:39,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:38:39,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:38:39,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:38:39,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:38:39,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:38:39,874 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:38:39,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:38:39,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:38:39,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:38:39,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:38:39,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:38:39,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:38:39,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:38:39,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:38:39,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:38:39,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:38:39,883 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:38:39,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:38:39,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:38:39,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:38:39,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:38:39,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:38:39,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:38:39,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:38:39,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:38:39,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:38:39,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:38:39,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:38:39,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:38:39,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:38:40,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:38:40,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:38:40,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:38:40,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:38:40,191 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:38:40,191 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-27 02:38:40,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e698e264a/f6a82bcca6e24a64a82e472c5125df18/FLAG9415ce488 [2019-12-27 02:38:40,849 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:38:40,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-27 02:38:40,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e698e264a/f6a82bcca6e24a64a82e472c5125df18/FLAG9415ce488 [2019-12-27 02:38:41,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e698e264a/f6a82bcca6e24a64a82e472c5125df18 [2019-12-27 02:38:41,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:38:41,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:38:41,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:38:41,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:38:41,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:38:41,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:41,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ede25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41, skipping insertion in model container [2019-12-27 02:38:41,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:41,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:38:41,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:38:41,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:38:41,783 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:38:41,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:38:41,939 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:38:41,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41 WrapperNode [2019-12-27 02:38:41,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:38:41,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:38:41,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:38:41,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:38:41,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:41,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:42,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:38:42,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:38:42,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:38:42,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:38:42,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:42,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:42,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:42,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:42,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:42,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:42,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (1/1) ... [2019-12-27 02:38:42,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:38:42,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:38:42,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:38:42,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:38:42,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (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-27 02:38:42,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:38:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:38:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:38:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:38:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:38:42,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:38:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:38:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:38:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:38:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:38:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:38:42,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:38:42,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:38:42,128 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:38:42,862 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:38:42,862 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:38:42,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:38:42 BoogieIcfgContainer [2019-12-27 02:38:42,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:38:42,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:38:42,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:38:42,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:38:42,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:38:41" (1/3) ... [2019-12-27 02:38:42,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adb12cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:38:42, skipping insertion in model container [2019-12-27 02:38:42,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:41" (2/3) ... [2019-12-27 02:38:42,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adb12cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:38:42, skipping insertion in model container [2019-12-27 02:38:42,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:38:42" (3/3) ... [2019-12-27 02:38:42,872 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2019-12-27 02:38:42,883 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:38:42,883 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:38:42,894 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:38:42,895 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:38:42,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,956 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,956 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,957 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,971 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,973 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,973 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,977 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:42,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:43,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:38:43,038 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:38:43,038 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:38:43,038 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:38:43,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:38:43,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:38:43,039 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:38:43,042 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:38:43,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:38:43,069 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 02:38:43,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 02:38:43,163 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 02:38:43,163 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:38:43,177 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:38:43,196 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 02:38:43,245 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 02:38:43,245 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:38:43,250 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:38:43,264 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 02:38:43,265 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:38:46,182 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-12-27 02:38:48,341 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 02:38:48,502 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:38:48,518 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-27 02:38:48,518 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 02:38:48,521 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-27 02:38:49,437 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-27 02:38:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-27 02:38:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 02:38:49,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:49,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:49,445 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-27 02:38:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-27 02:38:49,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:49,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736722649] [2019-12-27 02:38:49,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:49,728 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-27 02:38:49,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736722649] [2019-12-27 02:38:49,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:49,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:38:49,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93442155] [2019-12-27 02:38:49,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:49,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:49,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:49,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:49,758 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-27 02:38:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:50,087 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-27 02:38:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:50,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 02:38:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:50,247 INFO L225 Difference]: With dead ends: 16034 [2019-12-27 02:38:50,248 INFO L226 Difference]: Without dead ends: 15698 [2019-12-27 02:38:50,249 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-27 02:38:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-27 02:38:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-27 02:38:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-27 02:38:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-27 02:38:51,666 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-27 02:38:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:51,667 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-27 02:38:51,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-27 02:38:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:38:51,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:51,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:51,683 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-27 02:38:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:51,685 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-27 02:38:51,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:51,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441564088] [2019-12-27 02:38:51,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:51,822 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-27 02:38:51,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441564088] [2019-12-27 02:38:51,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:51,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:51,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907442334] [2019-12-27 02:38:51,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:38:51,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:38:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:38:51,825 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 4 states. [2019-12-27 02:38:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:52,449 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-27 02:38:52,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:38:52,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:38:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:52,551 INFO L225 Difference]: With dead ends: 24414 [2019-12-27 02:38:52,552 INFO L226 Difference]: Without dead ends: 24400 [2019-12-27 02:38:52,553 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-27 02:38:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-27 02:38:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-27 02:38:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-27 02:38:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-27 02:38:53,447 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-27 02:38:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:53,448 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-27 02:38:53,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:38:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-27 02:38:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:38:53,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:53,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:53,450 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-27 02:38:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-27 02:38:53,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:53,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398054675] [2019-12-27 02:38:53,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:53,501 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-27 02:38:53,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398054675] [2019-12-27 02:38:53,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:53,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:53,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616976755] [2019-12-27 02:38:53,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:53,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:53,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:53,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:53,504 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-27 02:38:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:53,560 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-27 02:38:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:53,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:38:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:53,588 INFO L225 Difference]: With dead ends: 12731 [2019-12-27 02:38:53,589 INFO L226 Difference]: Without dead ends: 12731 [2019-12-27 02:38:53,589 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-27 02:38:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-27 02:38:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-27 02:38:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-27 02:38:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-27 02:38:53,923 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-27 02:38:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:53,924 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-27 02:38:53,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-27 02:38:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:38:53,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:53,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:53,926 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-27 02:38:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:53,927 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-27 02:38:53,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:54,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540242773] [2019-12-27 02:38:54,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:54,849 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-27 02:38:54,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540242773] [2019-12-27 02:38:54,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:54,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:38:54,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664623309] [2019-12-27 02:38:54,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:38:54,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:54,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:38:54,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:38:54,852 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-27 02:38:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:54,873 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-27 02:38:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:38:54,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:38:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:54,877 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 02:38:54,877 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 02:38:54,877 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-27 02:38:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 02:38:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 02:38:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 02:38:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-27 02:38:54,908 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-27 02:38:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:54,909 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-27 02:38:54,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:38:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-27 02:38:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:38:54,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:54,911 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-27 02:38:54,912 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-27 02:38:54,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-27 02:38:54,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:54,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878075821] [2019-12-27 02:38:54,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:54,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-27 02:38:54,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878075821] [2019-12-27 02:38:54,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:54,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:38:54,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433949509] [2019-12-27 02:38:54,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:38:54,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:38:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:38:54,996 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 5 states. [2019-12-27 02:38:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:55,024 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-27 02:38:55,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:38:55,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:38:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:55,028 INFO L225 Difference]: With dead ends: 652 [2019-12-27 02:38:55,028 INFO L226 Difference]: Without dead ends: 652 [2019-12-27 02:38:55,028 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-27 02:38:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-27 02:38:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-27 02:38:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-27 02:38:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-27 02:38:55,040 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-27 02:38:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:55,041 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-27 02:38:55,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:38:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-27 02:38:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:55,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:55,046 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-27 02:38:55,046 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-27 02:38:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:55,046 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-27 02:38:55,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:55,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145763893] [2019-12-27 02:38:55,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:55,179 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-27 02:38:55,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145763893] [2019-12-27 02:38:55,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:55,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:38:55,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839650036] [2019-12-27 02:38:55,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:55,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:55,182 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-27 02:38:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:55,226 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-27 02:38:55,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:55,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:38:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:55,228 INFO L225 Difference]: With dead ends: 608 [2019-12-27 02:38:55,228 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 02:38:55,228 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-27 02:38:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 02:38:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-27 02:38:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 02:38:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-27 02:38:55,237 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-27 02:38:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:55,238 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-27 02:38:55,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-27 02:38:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:55,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:55,240 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-27 02:38:55,240 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-27 02:38:55,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-27 02:38:55,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:55,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851712934] [2019-12-27 02:38:55,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:55,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-27 02:38:55,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851712934] [2019-12-27 02:38:55,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:55,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:38:55,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675166783] [2019-12-27 02:38:55,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:55,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:55,340 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-27 02:38:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:55,383 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-27 02:38:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:55,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:38:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:55,385 INFO L225 Difference]: With dead ends: 608 [2019-12-27 02:38:55,385 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 02:38:55,385 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-27 02:38:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 02:38:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-27 02:38:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 02:38:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-27 02:38:55,395 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-27 02:38:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:55,396 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-27 02:38:55,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-27 02:38:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:55,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:55,398 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-27 02:38:55,398 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-27 02:38:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-27 02:38:55,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:55,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138958592] [2019-12-27 02:38:55,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:55,495 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-27 02:38:55,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138958592] [2019-12-27 02:38:55,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:55,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:38:55,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025792074] [2019-12-27 02:38:55,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:38:55,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:38:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:38:55,497 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-27 02:38:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:55,725 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-27 02:38:55,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:38:55,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 02:38:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:55,727 INFO L225 Difference]: With dead ends: 893 [2019-12-27 02:38:55,727 INFO L226 Difference]: Without dead ends: 893 [2019-12-27 02:38:55,727 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-27 02:38:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-27 02:38:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-27 02:38:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-27 02:38:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-27 02:38:55,740 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-27 02:38:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:55,741 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-27 02:38:55,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:38:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-27 02:38:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:55,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:55,744 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-27 02:38:55,745 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-27 02:38:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-27 02:38:55,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:55,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160722159] [2019-12-27 02:38:55,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:55,937 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-27 02:38:55,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160722159] [2019-12-27 02:38:55,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:55,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:55,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241212456] [2019-12-27 02:38:55,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:55,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:55,941 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 3 states. [2019-12-27 02:38:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:55,992 INFO L93 Difference]: Finished difference Result 718 states and 1686 transitions. [2019-12-27 02:38:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:55,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:38:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:55,993 INFO L225 Difference]: With dead ends: 718 [2019-12-27 02:38:55,994 INFO L226 Difference]: Without dead ends: 718 [2019-12-27 02:38:55,994 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-27 02:38:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-12-27 02:38:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 535. [2019-12-27 02:38:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-12-27 02:38:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1263 transitions. [2019-12-27 02:38:56,005 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1263 transitions. Word has length 55 [2019-12-27 02:38:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:56,005 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 1263 transitions. [2019-12-27 02:38:56,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1263 transitions. [2019-12-27 02:38:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:38:56,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:56,010 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-27 02:38:56,010 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-27 02:38:56,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:56,010 INFO L82 PathProgramCache]: Analyzing trace with hash -916645642, now seen corresponding path program 1 times [2019-12-27 02:38:56,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:56,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391873546] [2019-12-27 02:38:56,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:56,206 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-27 02:38:56,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391873546] [2019-12-27 02:38:56,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:56,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:38:56,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166014399] [2019-12-27 02:38:56,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:38:56,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:56,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:38:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:38:56,209 INFO L87 Difference]: Start difference. First operand 535 states and 1263 transitions. Second operand 7 states. [2019-12-27 02:38:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:56,358 INFO L93 Difference]: Finished difference Result 1016 states and 2240 transitions. [2019-12-27 02:38:56,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:38:56,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 02:38:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:56,362 INFO L225 Difference]: With dead ends: 1016 [2019-12-27 02:38:56,362 INFO L226 Difference]: Without dead ends: 683 [2019-12-27 02:38:56,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:38:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-27 02:38:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 472. [2019-12-27 02:38:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-27 02:38:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1080 transitions. [2019-12-27 02:38:56,375 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1080 transitions. Word has length 56 [2019-12-27 02:38:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:56,377 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 1080 transitions. [2019-12-27 02:38:56,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:38:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1080 transitions. [2019-12-27 02:38:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:38:56,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:56,379 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-27 02:38:56,379 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-27 02:38:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash -310787320, now seen corresponding path program 2 times [2019-12-27 02:38:56,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:56,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408823523] [2019-12-27 02:38:56,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:56,530 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-27 02:38:56,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408823523] [2019-12-27 02:38:56,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:56,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:38:56,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511031918] [2019-12-27 02:38:56,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:38:56,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:56,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:38:56,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:38:56,532 INFO L87 Difference]: Start difference. First operand 472 states and 1080 transitions. Second operand 5 states. [2019-12-27 02:38:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:56,591 INFO L93 Difference]: Finished difference Result 670 states and 1441 transitions. [2019-12-27 02:38:56,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:38:56,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 02:38:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:56,593 INFO L225 Difference]: With dead ends: 670 [2019-12-27 02:38:56,593 INFO L226 Difference]: Without dead ends: 247 [2019-12-27 02:38:56,593 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-27 02:38:56,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-27 02:38:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-12-27 02:38:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-12-27 02:38:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 448 transitions. [2019-12-27 02:38:56,597 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 448 transitions. Word has length 56 [2019-12-27 02:38:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:56,598 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 448 transitions. [2019-12-27 02:38:56,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:38:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 448 transitions. [2019-12-27 02:38:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:38:56,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:56,600 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-27 02:38:56,600 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-27 02:38:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1766354674, now seen corresponding path program 3 times [2019-12-27 02:38:56,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:56,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728314860] [2019-12-27 02:38:56,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:56,685 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-27 02:38:56,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728314860] [2019-12-27 02:38:56,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:56,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:56,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871609914] [2019-12-27 02:38:56,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:56,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:56,688 INFO L87 Difference]: Start difference. First operand 247 states and 448 transitions. Second operand 3 states. [2019-12-27 02:38:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:56,698 INFO L93 Difference]: Finished difference Result 236 states and 412 transitions. [2019-12-27 02:38:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:56,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 02:38:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:56,699 INFO L225 Difference]: With dead ends: 236 [2019-12-27 02:38:56,699 INFO L226 Difference]: Without dead ends: 236 [2019-12-27 02:38:56,700 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-27 02:38:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-12-27 02:38:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2019-12-27 02:38:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 02:38:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-27 02:38:56,704 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 56 [2019-12-27 02:38:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:56,704 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-27 02:38:56,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-27 02:38:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:38:56,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:56,705 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-27 02:38:56,705 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-27 02:38:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 1 times [2019-12-27 02:38:56,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:56,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690664240] [2019-12-27 02:38:56,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:56,971 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-27 02:38:56,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690664240] [2019-12-27 02:38:56,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:56,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:38:56,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109655539] [2019-12-27 02:38:56,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:38:56,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:56,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:38:56,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:38:56,978 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 13 states. [2019-12-27 02:38:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:57,376 INFO L93 Difference]: Finished difference Result 360 states and 604 transitions. [2019-12-27 02:38:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 02:38:57,376 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 02:38:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:57,377 INFO L225 Difference]: With dead ends: 360 [2019-12-27 02:38:57,377 INFO L226 Difference]: Without dead ends: 327 [2019-12-27 02:38:57,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:38:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-27 02:38:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2019-12-27 02:38:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 02:38:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 546 transitions. [2019-12-27 02:38:57,388 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 546 transitions. Word has length 57 [2019-12-27 02:38:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:57,389 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 546 transitions. [2019-12-27 02:38:57,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:38:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 546 transitions. [2019-12-27 02:38:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:38:57,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:57,393 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-27 02:38:57,393 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-27 02:38:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 2 times [2019-12-27 02:38:57,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:57,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296663384] [2019-12-27 02:38:57,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:38:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:38:57,563 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:38:57,563 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:38:57,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$w_buff0~0_225) (= v_~x~0_72 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~__unbuffered_cnt~0_82) (= v_~y$w_buff1_used~0_382 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1211~0.base_25|) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25|) |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_23 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1211~0.base_25| 4) |v_#length_23|) (= 0 v_~y$r_buff0_thd3~0_195) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 v_~y$flush_delayed~0_58) (= 0 |v_#NULL.base_6|) (= v_~z~0_106 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= v_~y$mem_tmp~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_120) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25| 1)) (= v_~a~0_45 0) (= |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0) (= v_~y~0_155 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25|)) (= 0 v_~y$r_buff1_thd3~0_156) (= v_~y$r_buff0_thd0~0_325 0) (= v_~weak$$choice2~0_108 0) (= v_~y$r_buff1_thd0~0_281 0) (= v_~y$w_buff0_used~0_625 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_22|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_28|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_26|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ULTIMATE.start_main_~#t1211~0.base=|v_ULTIMATE.start_main_~#t1211~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_25|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_72, ~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_625, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_41|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_~#t1211~0.offset=|v_ULTIMATE.start_main_~#t1211~0.offset_19|, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_106|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_106, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_24|, ~y$w_buff0~0=v_~y$w_buff0~0_225, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_195, ~y~0=v_~y~0_155, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_28|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_48|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_163, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_382} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, 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_~#t1213~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~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_~#t1211~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1212~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_~#t1211~0.offset, 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, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1212~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, 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-27 02:38:57,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13|) |v_ULTIMATE.start_main_~#t1212~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1212~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1212~0.base_13|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1212~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1212~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_11|, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1212~0.offset, ULTIMATE.start_main_~#t1212~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 02:38:57,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13|) |v_ULTIMATE.start_main_~#t1213~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1213~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1213~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1213~0.base_13| 0)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1213~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_13|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, ULTIMATE.start_main_~#t1213~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 02:38:57,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= v_~y$w_buff0~0_33 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_130 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_12| v_P2Thread1of1ForFork0_~arg.base_12) (= 0 (mod v_~y$w_buff1_used~0_75 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= 2 v_~y$w_buff0~0_32) (= v_~y$w_buff1_used~0_75 v_~y$w_buff0_used~0_131) (= |v_P2Thread1of1ForFork0_#in~arg.offset_12| v_P2Thread1of1ForFork0_~arg.offset_12)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff0~0=v_~y$w_buff0~0_33, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_12, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_32, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_12, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} 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-27 02:38:57,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~a~0_29 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~x~0_52 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_29, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_52, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 02:38:57,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In760834627 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In760834627 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out760834627| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out760834627| ~y$w_buff0_used~0_In760834627) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In760834627, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In760834627} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In760834627, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out760834627|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In760834627} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 02:38:57,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In328413563 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In328413563 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In328413563 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In328413563 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out328413563|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In328413563 |P2Thread1of1ForFork0_#t~ite12_Out328413563|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In328413563, ~y$w_buff0_used~0=~y$w_buff0_used~0_In328413563, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In328413563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In328413563} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In328413563, ~y$w_buff0_used~0=~y$w_buff0_used~0_In328413563, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out328413563|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In328413563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In328413563} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 02:38:57,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1309285719 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1309285719 256)))) (or (and (= ~y$r_buff0_thd3~0_In1309285719 ~y$r_buff0_thd3~0_Out1309285719) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out1309285719) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1309285719, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1309285719} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1309285719, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1309285719, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1309285719|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 02:38:57,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-383692564 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-383692564 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-383692564 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-383692564 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out-383692564| ~y$r_buff1_thd3~0_In-383692564)) (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-383692564|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-383692564, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-383692564, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-383692564, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383692564} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-383692564|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-383692564, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-383692564, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-383692564, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383692564} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 02:38:57,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_28| v_~y$r_buff1_thd3~0_94) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_94, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, 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-27 02:38:57,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-2144801074 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2144801074 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-2144801074| ~y~0_In-2144801074) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-2144801074| ~y$w_buff1~0_In-2144801074) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2144801074, ~y$w_buff1~0=~y$w_buff1~0_In-2144801074, ~y~0=~y~0_In-2144801074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2144801074} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2144801074, ~y$w_buff1~0=~y$w_buff1~0_In-2144801074, ~y~0=~y~0_In-2144801074, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-2144801074|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2144801074} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:38:57,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_39 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_9|, ~y~0=v_~y~0_39, 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-27 02:38:57,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In85391335 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In85391335 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out85391335|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In85391335 |P1Thread1of1ForFork2_#t~ite5_Out85391335|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In85391335, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In85391335} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In85391335, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In85391335, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out85391335|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:38:57,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-538703647 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-538703647 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-538703647 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-538703647 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-538703647|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-538703647 |P1Thread1of1ForFork2_#t~ite6_Out-538703647|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-538703647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-538703647, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-538703647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-538703647} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-538703647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-538703647, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-538703647, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-538703647|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-538703647} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:38:57,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-665034571 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-665034571 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out-665034571| ~y$r_buff0_thd2~0_In-665034571) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-665034571| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-665034571, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-665034571} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-665034571, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-665034571, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-665034571|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:38:57,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In2115752483 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In2115752483 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2115752483 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2115752483 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out2115752483|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite8_Out2115752483| ~y$r_buff1_thd2~0_In2115752483) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2115752483, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115752483, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2115752483, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2115752483} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2115752483, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115752483, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out2115752483|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2115752483, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2115752483} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:38:57,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork2_#t~ite8_30| v_~y$r_buff1_thd2~0_111) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, 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-27 02:38:57,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:38:57,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1936061990 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1936061990 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite19_Out1936061990| |ULTIMATE.start_main_#t~ite18_Out1936061990|))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In1936061990 |ULTIMATE.start_main_#t~ite18_Out1936061990|)) (and (not .cse1) (= ~y$w_buff1~0_In1936061990 |ULTIMATE.start_main_#t~ite18_Out1936061990|) (not .cse2) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1936061990, ~y~0=~y~0_In1936061990, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1936061990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1936061990} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1936061990, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1936061990|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1936061990|, ~y~0=~y~0_In1936061990, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1936061990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1936061990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 02:38:57,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-588693704 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-588693704 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-588693704| ~y$w_buff0_used~0_In-588693704) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-588693704| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-588693704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-588693704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-588693704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-588693704, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-588693704|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:38:57,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-67243437 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-67243437 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-67243437 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-67243437 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out-67243437|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-67243437 |ULTIMATE.start_main_#t~ite21_Out-67243437|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-67243437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-67243437, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-67243437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-67243437} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-67243437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-67243437, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-67243437|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-67243437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-67243437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:38:57,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In263918599 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In263918599 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out263918599|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In263918599 |ULTIMATE.start_main_#t~ite22_Out263918599|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In263918599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In263918599} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In263918599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In263918599, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out263918599|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:38:57,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-638289171 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-638289171 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-638289171 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-638289171 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-638289171 |ULTIMATE.start_main_#t~ite23_Out-638289171|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-638289171|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-638289171, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-638289171, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-638289171, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638289171} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-638289171, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-638289171, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-638289171, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-638289171|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638289171} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 02:38:57,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1160144017 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1160144017 256)))) (or (= (mod ~y$w_buff0_used~0_In-1160144017 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1160144017 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1160144017 256))))) (= ~y$w_buff1~0_In-1160144017 |ULTIMATE.start_main_#t~ite32_Out-1160144017|) .cse1 (= |ULTIMATE.start_main_#t~ite33_Out-1160144017| |ULTIMATE.start_main_#t~ite32_Out-1160144017|)) (and (= ~y$w_buff1~0_In-1160144017 |ULTIMATE.start_main_#t~ite33_Out-1160144017|) (= |ULTIMATE.start_main_#t~ite32_In-1160144017| |ULTIMATE.start_main_#t~ite32_Out-1160144017|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1160144017, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1160144017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1160144017, ~weak$$choice2~0=~weak$$choice2~0_In-1160144017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1160144017, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-1160144017|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1160144017} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1160144017, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1160144017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1160144017, ~weak$$choice2~0=~weak$$choice2~0_In-1160144017, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1160144017|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1160144017, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1160144017|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1160144017} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 02:38:57,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-96333239 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-96333239 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-96333239 256))) (and .cse0 (= (mod ~y$w_buff1_used~0_In-96333239 256) 0)) (= (mod ~y$w_buff0_used~0_In-96333239 256) 0))) (= |ULTIMATE.start_main_#t~ite36_Out-96333239| |ULTIMATE.start_main_#t~ite35_Out-96333239|) (= ~y$w_buff0_used~0_In-96333239 |ULTIMATE.start_main_#t~ite35_Out-96333239|) .cse1) (and (= ~y$w_buff0_used~0_In-96333239 |ULTIMATE.start_main_#t~ite36_Out-96333239|) (= |ULTIMATE.start_main_#t~ite35_In-96333239| |ULTIMATE.start_main_#t~ite35_Out-96333239|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-96333239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-96333239, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-96333239|, ~weak$$choice2~0=~weak$$choice2~0_In-96333239, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-96333239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96333239} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-96333239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-96333239, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-96333239|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-96333239|, ~weak$$choice2~0=~weak$$choice2~0_In-96333239, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-96333239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96333239} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:38:57,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1026363291 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1026363291| ~y$w_buff1_used~0_In-1026363291) (= |ULTIMATE.start_main_#t~ite39_Out-1026363291| |ULTIMATE.start_main_#t~ite38_Out-1026363291|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1026363291 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1026363291 256)) (and (= (mod ~y$w_buff1_used~0_In-1026363291 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In-1026363291 256) 0) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1026363291| ~y$w_buff1_used~0_In-1026363291) (= |ULTIMATE.start_main_#t~ite38_In-1026363291| |ULTIMATE.start_main_#t~ite38_Out-1026363291|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026363291, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026363291, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1026363291|, ~weak$$choice2~0=~weak$$choice2~0_In-1026363291, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1026363291, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1026363291} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026363291, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1026363291|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026363291, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1026363291|, ~weak$$choice2~0=~weak$$choice2~0_In-1026363291, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1026363291, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1026363291} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:38:57,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd0~0_100 v_~y$r_buff0_thd0~0_99)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} 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-27 02:38:57,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L839-->L4: Formula: (and (= v_~y~0_138 v_~y$mem_tmp~0_17) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~y$flush_delayed~0_52) (not (= (mod v_~y$flush_delayed~0_53 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_52, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~y~0=v_~y~0_138, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~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-27 02:38:57,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:38:57,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:38:57 BasicIcfg [2019-12-27 02:38:57,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:38:57,695 INFO L168 Benchmark]: Toolchain (without parser) took 16530.73 ms. Allocated memory was 145.8 MB in the beginning and 838.3 MB in the end (delta: 692.6 MB). Free memory was 100.9 MB in the beginning and 524.3 MB in the end (delta: -423.3 MB). Peak memory consumption was 269.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:57,696 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 02:38:57,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.48 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 157.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:57,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.42 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 153.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:57,698 INFO L168 Benchmark]: Boogie Preprocessor took 37.61 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:57,699 INFO L168 Benchmark]: RCFGBuilder took 818.77 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 104.8 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:57,699 INFO L168 Benchmark]: TraceAbstraction took 14828.40 ms. Allocated memory was 203.4 MB in the beginning and 838.3 MB in the end (delta: 634.9 MB). Free memory was 104.2 MB in the beginning and 524.3 MB in the end (delta: -420.1 MB). Peak memory consumption was 214.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:57,703 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.48 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 157.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.42 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 153.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.61 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.77 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 104.8 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14828.40 ms. Allocated memory was 203.4 MB in the beginning and 838.3 MB in the end (delta: 634.9 MB). Free memory was 104.2 MB in the beginning and 524.3 MB in the end (delta: -420.1 MB). Peak memory consumption was 214.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 26 ChoiceCompositions, 4376 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 58 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46792 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1211, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L812] FCALL, FORK 0 pthread_create(&t1212, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L814] FCALL, FORK 0 pthread_create(&t1213, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L787] 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) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L752] 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=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 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 [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 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 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L831] 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=1, __unbuffered_p2_EBX=0, a=1, 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] [L831] 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) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L837] 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=1, __unbuffered_p2_EBX=0, a=1, 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] [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1248 SDtfs, 1021 SDslu, 2329 SDs, 0 SdLazy, 784 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred 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.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 2786 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 100507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...