/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:12:49,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:12:49,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:12:49,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:12:49,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:12:49,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:12:49,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:12:49,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:12:49,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:12:49,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:12:49,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:12:49,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:12:49,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:12:49,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:12:49,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:12:49,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:12:49,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:12:49,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:12:49,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:12:49,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:12:49,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:12:49,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:12:49,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:12:49,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:12:49,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:12:49,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:12:49,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:12:49,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:12:49,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:12:49,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:12:49,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:12:49,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:12:49,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:12:49,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:12:49,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:12:49,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:12:49,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:12:49,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:12:49,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:12:49,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:12:49,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:12:49,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:12:49,906 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:12:49,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:12:49,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:12:49,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:12:49,908 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:12:49,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:12:49,909 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:12:49,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:12:49,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:12:49,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:12:49,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:12:49,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:12:49,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:12:49,910 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:12:49,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:12:49,911 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:12:49,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:12:49,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:12:49,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:12:49,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:12:49,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:12:49,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:12:49,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:12:49,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:12:49,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:12:49,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:12:49,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:12:49,913 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:12:49,913 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:12:49,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:12:49,914 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:12:49,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:12:50,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:12:50,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:12:50,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:12:50,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:12:50,201 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:12:50,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-27 21:12:50,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b69da6a/1c538883dc5d408ca737a68f6e4982b6/FLAG095c3e4dd [2019-12-27 21:12:50,829 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:12:50,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-27 21:12:50,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b69da6a/1c538883dc5d408ca737a68f6e4982b6/FLAG095c3e4dd [2019-12-27 21:12:51,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b69da6a/1c538883dc5d408ca737a68f6e4982b6 [2019-12-27 21:12:51,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:12:51,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:12:51,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:51,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:12:51,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:12:51,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:51,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51, skipping insertion in model container [2019-12-27 21:12:51,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:51,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:12:51,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:12:51,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:51,799 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:12:51,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:51,942 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:12:51,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51 WrapperNode [2019-12-27 21:12:51,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:51,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:51,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:12:51,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:12:51,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:51,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:52,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:52,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:12:52,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:12:52,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:12:52,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:52,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:52,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:52,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:52,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:52,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:52,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (1/1) ... [2019-12-27 21:12:52,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:12:52,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:12:52,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:12:52,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:12:52,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (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 21:12:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:12:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:12:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:12:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:12:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:12:52,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:12:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:12:52,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:12:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:12:52,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:12:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:12:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:12:52,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:12:52,146 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 21:12:52,938 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:12:52,938 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:12:52,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:52 BoogieIcfgContainer [2019-12-27 21:12:52,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:12:52,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:12:52,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:12:52,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:12:52,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:12:51" (1/3) ... [2019-12-27 21:12:52,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518d374f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:52, skipping insertion in model container [2019-12-27 21:12:52,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:51" (2/3) ... [2019-12-27 21:12:52,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518d374f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:52, skipping insertion in model container [2019-12-27 21:12:52,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:52" (3/3) ... [2019-12-27 21:12:52,949 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2019-12-27 21:12:52,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:12:52,959 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:12:52,966 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:12:52,967 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:12:53,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,015 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,015 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,016 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,016 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,016 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,027 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,028 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,054 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:53,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:12:53,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:12:53,100 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:12:53,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:12:53,104 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:12:53,105 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:12:53,105 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:12:53,106 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:12:53,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:12:53,135 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 21:12:53,137 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 21:12:53,232 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 21:12:53,233 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:53,247 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:12:53,268 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 21:12:53,356 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 21:12:53,356 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:53,365 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:12:53,386 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 21:12:53,387 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:12:57,034 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:12:57,169 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:12:57,188 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-27 21:12:57,188 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 21:12:57,192 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-27 21:12:58,080 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 21:12:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 21:12:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:12:58,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:58,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:58,091 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 21:12:58,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:58,100 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 21:12:58,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:58,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884600806] [2019-12-27 21:12:58,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:58,406 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 21:12:58,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884600806] [2019-12-27 21:12:58,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:58,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:12:58,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374761886] [2019-12-27 21:12:58,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:58,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:58,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:12:58,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:58,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:58,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:58,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:58,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:58,454 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 21:12:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:58,829 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-27 21:12:58,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:58,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:12:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:59,051 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 21:12:59,052 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 21:12:59,057 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 21:12:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 21:12:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 21:12:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 21:12:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-27 21:12:59,919 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-27 21:12:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:59,920 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-27 21:12:59,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-27 21:12:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:12:59,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:59,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:59,934 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 21:12:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 21:12:59,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:59,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431857617] [2019-12-27 21:12:59,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:00,119 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 21:13:00,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431857617] [2019-12-27 21:13:00,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:00,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:00,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176273740] [2019-12-27 21:13:00,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:00,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:00,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:13:00,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:00,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:00,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:00,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:00,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:00,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:00,133 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-27 21:13:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:01,471 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-27 21:13:01,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:01,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 21:13:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:01,571 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 21:13:01,571 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 21:13:01,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 21:13:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 21:13:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 21:13:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-27 21:13:02,380 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-27 21:13:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:02,381 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-27 21:13:02,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-27 21:13:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:13:02,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:02,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:02,384 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 21:13:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 21:13:02,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:02,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529126922] [2019-12-27 21:13:02,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:02,463 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 21:13:02,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529126922] [2019-12-27 21:13:02,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:02,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:02,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1401519772] [2019-12-27 21:13:02,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:02,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:02,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 21:13:02,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:02,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:13:02,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:02,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:02,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:02,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:02,520 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 5 states. [2019-12-27 21:13:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:02,971 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-27 21:13:02,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:02,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 21:13:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:03,311 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 21:13:03,312 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 21:13:03,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 21:13:05,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-27 21:13:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-27 21:13:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-27 21:13:05,369 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-27 21:13:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:05,369 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-27 21:13:05,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-27 21:13:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 21:13:05,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:05,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:05,380 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 21:13:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 21:13:05,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:05,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784254141] [2019-12-27 21:13:05,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:05,544 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 21:13:05,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784254141] [2019-12-27 21:13:05,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:05,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:05,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1180721121] [2019-12-27 21:13:05,547 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:05,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:05,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 24 transitions. [2019-12-27 21:13:05,555 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:05,556 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:05,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:05,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:05,558 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-27 21:13:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:06,123 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-27 21:13:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:13:06,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 21:13:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:06,239 INFO L225 Difference]: With dead ends: 29780 [2019-12-27 21:13:06,239 INFO L226 Difference]: Without dead ends: 29766 [2019-12-27 21:13:06,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:13:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-27 21:13:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-27 21:13:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-27 21:13:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-27 21:13:07,050 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-27 21:13:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:07,050 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-27 21:13:07,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-27 21:13:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:13:07,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:07,073 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] [2019-12-27 21:13:07,074 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 21:13:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-27 21:13:07,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:07,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893180069] [2019-12-27 21:13:07,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:07,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 21:13:07,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893180069] [2019-12-27 21:13:07,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:07,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:13:07,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32911416] [2019-12-27 21:13:07,208 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:07,213 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:07,220 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:13:07,220 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:07,221 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:07,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:13:07,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:07,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:13:07,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:07,222 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 6 states. [2019-12-27 21:13:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:07,969 INFO L93 Difference]: Finished difference Result 32226 states and 113712 transitions. [2019-12-27 21:13:07,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:13:07,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:13:07,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:08,070 INFO L225 Difference]: With dead ends: 32226 [2019-12-27 21:13:08,071 INFO L226 Difference]: Without dead ends: 32194 [2019-12-27 21:13:08,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:13:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-12-27 21:13:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 27516. [2019-12-27 21:13:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27516 states. [2019-12-27 21:13:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27516 states to 27516 states and 97909 transitions. [2019-12-27 21:13:09,273 INFO L78 Accepts]: Start accepts. Automaton has 27516 states and 97909 transitions. Word has length 27 [2019-12-27 21:13:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:09,273 INFO L462 AbstractCegarLoop]: Abstraction has 27516 states and 97909 transitions. [2019-12-27 21:13:09,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:13:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 27516 states and 97909 transitions. [2019-12-27 21:13:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:09,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:09,322 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] [2019-12-27 21:13:09,322 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 21:13:09,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash -386322379, now seen corresponding path program 1 times [2019-12-27 21:13:09,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:09,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124818003] [2019-12-27 21:13:09,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:09,394 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 21:13:09,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124818003] [2019-12-27 21:13:09,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:09,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:09,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437207444] [2019-12-27 21:13:09,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:09,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:09,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 35 transitions. [2019-12-27 21:13:09,412 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:09,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:09,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:09,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:09,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:09,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:09,414 INFO L87 Difference]: Start difference. First operand 27516 states and 97909 transitions. Second operand 3 states. [2019-12-27 21:13:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:09,595 INFO L93 Difference]: Finished difference Result 34788 states and 124357 transitions. [2019-12-27 21:13:09,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:09,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 21:13:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:09,689 INFO L225 Difference]: With dead ends: 34788 [2019-12-27 21:13:09,690 INFO L226 Difference]: Without dead ends: 34788 [2019-12-27 21:13:09,690 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 21:13:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-27 21:13:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 30668. [2019-12-27 21:13:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 21:13:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 110245 transitions. [2019-12-27 21:13:10,706 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 110245 transitions. Word has length 33 [2019-12-27 21:13:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:10,707 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 110245 transitions. [2019-12-27 21:13:10,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 110245 transitions. [2019-12-27 21:13:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:10,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:10,741 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] [2019-12-27 21:13:10,741 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 21:13:10,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:10,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1183375097, now seen corresponding path program 1 times [2019-12-27 21:13:10,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:10,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278046116] [2019-12-27 21:13:10,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:10,819 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 21:13:10,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278046116] [2019-12-27 21:13:10,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:10,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:10,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912228288] [2019-12-27 21:13:10,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:10,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:10,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 35 transitions. [2019-12-27 21:13:10,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:10,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:10,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:10,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:10,840 INFO L87 Difference]: Start difference. First operand 30668 states and 110245 transitions. Second operand 3 states. [2019-12-27 21:13:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:11,346 INFO L93 Difference]: Finished difference Result 30668 states and 109909 transitions. [2019-12-27 21:13:11,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:11,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 21:13:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:11,406 INFO L225 Difference]: With dead ends: 30668 [2019-12-27 21:13:11,407 INFO L226 Difference]: Without dead ends: 30668 [2019-12-27 21:13:11,407 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 21:13:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30668 states. [2019-12-27 21:13:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30668 to 30668. [2019-12-27 21:13:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 21:13:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 109909 transitions. [2019-12-27 21:13:11,940 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 109909 transitions. Word has length 33 [2019-12-27 21:13:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:11,941 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 109909 transitions. [2019-12-27 21:13:11,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 109909 transitions. [2019-12-27 21:13:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:11,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:11,968 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] [2019-12-27 21:13:11,968 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 21:13:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1422326855, now seen corresponding path program 1 times [2019-12-27 21:13:11,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:11,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085368778] [2019-12-27 21:13:11,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:12,064 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 21:13:12,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085368778] [2019-12-27 21:13:12,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:12,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:12,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1612941127] [2019-12-27 21:13:12,066 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:12,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:12,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 52 transitions. [2019-12-27 21:13:12,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:12,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:12,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:12,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:12,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:12,090 INFO L87 Difference]: Start difference. First operand 30668 states and 109909 transitions. Second operand 7 states. [2019-12-27 21:13:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:13,124 INFO L93 Difference]: Finished difference Result 47574 states and 166546 transitions. [2019-12-27 21:13:13,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:13:13,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:13:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:13,222 INFO L225 Difference]: With dead ends: 47574 [2019-12-27 21:13:13,222 INFO L226 Difference]: Without dead ends: 47534 [2019-12-27 21:13:13,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:13:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47534 states. [2019-12-27 21:13:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47534 to 31416. [2019-12-27 21:13:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31416 states. [2019-12-27 21:13:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31416 states to 31416 states and 112497 transitions. [2019-12-27 21:13:15,227 INFO L78 Accepts]: Start accepts. Automaton has 31416 states and 112497 transitions. Word has length 33 [2019-12-27 21:13:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:15,228 INFO L462 AbstractCegarLoop]: Abstraction has 31416 states and 112497 transitions. [2019-12-27 21:13:15,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 31416 states and 112497 transitions. [2019-12-27 21:13:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:15,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:15,259 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] [2019-12-27 21:13:15,260 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 21:13:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash 147370621, now seen corresponding path program 1 times [2019-12-27 21:13:15,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:15,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989607901] [2019-12-27 21:13:15,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:15,362 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 21:13:15,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989607901] [2019-12-27 21:13:15,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:15,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:15,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463520865] [2019-12-27 21:13:15,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:15,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:15,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 52 transitions. [2019-12-27 21:13:15,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:15,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:15,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:15,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:15,392 INFO L87 Difference]: Start difference. First operand 31416 states and 112497 transitions. Second operand 7 states. [2019-12-27 21:13:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:16,156 INFO L93 Difference]: Finished difference Result 44276 states and 155683 transitions. [2019-12-27 21:13:16,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:13:16,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:13:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:16,243 INFO L225 Difference]: With dead ends: 44276 [2019-12-27 21:13:16,244 INFO L226 Difference]: Without dead ends: 44250 [2019-12-27 21:13:16,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:13:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44250 states. [2019-12-27 21:13:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44250 to 35296. [2019-12-27 21:13:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35296 states. [2019-12-27 21:13:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35296 states to 35296 states and 125497 transitions. [2019-12-27 21:13:17,237 INFO L78 Accepts]: Start accepts. Automaton has 35296 states and 125497 transitions. Word has length 33 [2019-12-27 21:13:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:17,237 INFO L462 AbstractCegarLoop]: Abstraction has 35296 states and 125497 transitions. [2019-12-27 21:13:17,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 35296 states and 125497 transitions. [2019-12-27 21:13:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:17,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:17,262 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] [2019-12-27 21:13:17,262 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 21:13:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 528874148, now seen corresponding path program 1 times [2019-12-27 21:13:17,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:17,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106838533] [2019-12-27 21:13:17,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:17,332 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 21:13:17,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106838533] [2019-12-27 21:13:17,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:17,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:17,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436591845] [2019-12-27 21:13:17,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:17,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:17,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 21:13:17,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:17,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:17,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:17,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:17,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:17,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:17,352 INFO L87 Difference]: Start difference. First operand 35296 states and 125497 transitions. Second operand 4 states. [2019-12-27 21:13:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:17,440 INFO L93 Difference]: Finished difference Result 20235 states and 61968 transitions. [2019-12-27 21:13:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:13:17,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 21:13:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:17,467 INFO L225 Difference]: With dead ends: 20235 [2019-12-27 21:13:17,468 INFO L226 Difference]: Without dead ends: 19705 [2019-12-27 21:13:17,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19705 states. [2019-12-27 21:13:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19705 to 19705. [2019-12-27 21:13:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-27 21:13:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 60462 transitions. [2019-12-27 21:13:17,750 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 60462 transitions. Word has length 33 [2019-12-27 21:13:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:17,750 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 60462 transitions. [2019-12-27 21:13:17,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 60462 transitions. [2019-12-27 21:13:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:13:17,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:17,761 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] [2019-12-27 21:13:17,761 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 21:13:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1883155701, now seen corresponding path program 1 times [2019-12-27 21:13:17,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:17,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631162265] [2019-12-27 21:13:17,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:17,834 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 21:13:17,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631162265] [2019-12-27 21:13:17,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:17,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:13:17,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1235087430] [2019-12-27 21:13:17,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:17,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:18,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 42 transitions. [2019-12-27 21:13:18,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:18,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:13:18,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:13:18,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:18,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:13:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:18,457 INFO L87 Difference]: Start difference. First operand 19705 states and 60462 transitions. Second operand 6 states. [2019-12-27 21:13:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:18,518 INFO L93 Difference]: Finished difference Result 2732 states and 6358 transitions. [2019-12-27 21:13:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:18,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 21:13:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:18,522 INFO L225 Difference]: With dead ends: 2732 [2019-12-27 21:13:18,522 INFO L226 Difference]: Without dead ends: 2423 [2019-12-27 21:13:18,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:13:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-12-27 21:13:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-12-27 21:13:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-27 21:13:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 5497 transitions. [2019-12-27 21:13:18,555 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 5497 transitions. Word has length 34 [2019-12-27 21:13:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:18,555 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 5497 transitions. [2019-12-27 21:13:18,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:13:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 5497 transitions. [2019-12-27 21:13:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 21:13:18,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:18,559 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] [2019-12-27 21:13:18,559 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 21:13:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-27 21:13:18,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:18,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730920109] [2019-12-27 21:13:18,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:18,694 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 21:13:18,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730920109] [2019-12-27 21:13:18,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:18,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:18,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63531005] [2019-12-27 21:13:18,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:18,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:18,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 55 transitions. [2019-12-27 21:13:18,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:18,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:13:18,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:18,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:18,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:18,748 INFO L87 Difference]: Start difference. First operand 2423 states and 5497 transitions. Second operand 7 states. [2019-12-27 21:13:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:18,834 INFO L93 Difference]: Finished difference Result 706 states and 1597 transitions. [2019-12-27 21:13:18,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:13:18,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 21:13:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:18,836 INFO L225 Difference]: With dead ends: 706 [2019-12-27 21:13:18,836 INFO L226 Difference]: Without dead ends: 660 [2019-12-27 21:13:18,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:13:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-27 21:13:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 604. [2019-12-27 21:13:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 21:13:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2019-12-27 21:13:18,851 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 45 [2019-12-27 21:13:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:18,851 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2019-12-27 21:13:18,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2019-12-27 21:13:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:13:18,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:18,853 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 21:13:18,854 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 21:13:18,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:18,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1913212359, now seen corresponding path program 1 times [2019-12-27 21:13:18,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:18,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440832179] [2019-12-27 21:13:18,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:18,944 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 21:13:18,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440832179] [2019-12-27 21:13:18,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:18,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:18,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066476586] [2019-12-27 21:13:18,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:18,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:19,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 134 transitions. [2019-12-27 21:13:19,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:19,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:13:19,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:19,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:19,060 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand 5 states. [2019-12-27 21:13:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:19,264 INFO L93 Difference]: Finished difference Result 875 states and 2004 transitions. [2019-12-27 21:13:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:13:19,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 21:13:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:19,266 INFO L225 Difference]: With dead ends: 875 [2019-12-27 21:13:19,266 INFO L226 Difference]: Without dead ends: 875 [2019-12-27 21:13:19,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 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 21:13:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-27 21:13:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 640. [2019-12-27 21:13:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 21:13:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1467 transitions. [2019-12-27 21:13:19,278 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1467 transitions. Word has length 56 [2019-12-27 21:13:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:19,278 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1467 transitions. [2019-12-27 21:13:19,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1467 transitions. [2019-12-27 21:13:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:13:19,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:19,280 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 21:13:19,280 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 21:13:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1265963483, now seen corresponding path program 2 times [2019-12-27 21:13:19,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:19,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389192112] [2019-12-27 21:13:19,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:19,373 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 21:13:19,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389192112] [2019-12-27 21:13:19,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:19,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:19,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [167817020] [2019-12-27 21:13:19,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:19,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:19,460 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 129 transitions. [2019-12-27 21:13:19,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:19,488 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:13:19,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:19,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:19,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:19,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:19,489 INFO L87 Difference]: Start difference. First operand 640 states and 1467 transitions. Second operand 5 states. [2019-12-27 21:13:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:19,670 INFO L93 Difference]: Finished difference Result 820 states and 1826 transitions. [2019-12-27 21:13:19,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:13:19,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 21:13:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:19,672 INFO L225 Difference]: With dead ends: 820 [2019-12-27 21:13:19,672 INFO L226 Difference]: Without dead ends: 820 [2019-12-27 21:13:19,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-27 21:13:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 604. [2019-12-27 21:13:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 21:13:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-27 21:13:19,683 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-27 21:13:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:19,683 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-27 21:13:19,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-27 21:13:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:13:19,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:19,685 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 21:13:19,685 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-27 21:13:19,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:19,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371769654] [2019-12-27 21:13:19,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:19,847 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 21:13:19,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371769654] [2019-12-27 21:13:19,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:19,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:13:19,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067924761] [2019-12-27 21:13:19,848 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:19,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:19,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 132 transitions. [2019-12-27 21:13:19,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:19,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:13:19,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:13:19,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:13:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:13:19,942 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 8 states. [2019-12-27 21:13:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:20,087 INFO L93 Difference]: Finished difference Result 956 states and 2008 transitions. [2019-12-27 21:13:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:13:20,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 21:13:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:20,088 INFO L225 Difference]: With dead ends: 956 [2019-12-27 21:13:20,089 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 21:13:20,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:13:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 21:13:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 542. [2019-12-27 21:13:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-27 21:13:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-27 21:13:20,097 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-27 21:13:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:20,097 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-27 21:13:20,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:13:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-27 21:13:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:13:20,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:20,098 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 21:13:20,099 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:20,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:20,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 2 times [2019-12-27 21:13:20,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:20,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599218776] [2019-12-27 21:13:20,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:20,515 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 21:13:20,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599218776] [2019-12-27 21:13:20,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:20,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:13:20,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967481115] [2019-12-27 21:13:20,516 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:20,532 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:20,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 130 transitions. [2019-12-27 21:13:20,579 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:20,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:13:20,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:13:20,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:20,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:13:20,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:13:20,677 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 14 states. [2019-12-27 21:13:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:21,490 INFO L93 Difference]: Finished difference Result 927 states and 2054 transitions. [2019-12-27 21:13:21,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:13:21,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 21:13:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:21,492 INFO L225 Difference]: With dead ends: 927 [2019-12-27 21:13:21,492 INFO L226 Difference]: Without dead ends: 897 [2019-12-27 21:13:21,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:13:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-27 21:13:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 753. [2019-12-27 21:13:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-27 21:13:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1644 transitions. [2019-12-27 21:13:21,502 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1644 transitions. Word has length 57 [2019-12-27 21:13:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:21,502 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1644 transitions. [2019-12-27 21:13:21,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:13:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1644 transitions. [2019-12-27 21:13:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:13:21,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:21,504 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 21:13:21,504 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:21,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 3 times [2019-12-27 21:13:21,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:21,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863345186] [2019-12-27 21:13:21,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:13:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:13:21,622 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:13:21,622 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:13:21,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~a~0_11 0) (= v_~z~0_11 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27|) |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0)) |v_#memory_int_15|) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= (store .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27| 1) |v_#valid_54|) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1108~0.base_27| 4)) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27|)) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1108~0.base_27|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_26|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ULTIMATE.start_main_~#t1108~0.offset=|v_ULTIMATE.start_main_~#t1108~0.offset_21|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_16|, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1108~0.base=|v_ULTIMATE.start_main_~#t1108~0.base_27|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_20|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1109~0.base, #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, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1108~0.offset, ULTIMATE.start_main_~#t1110~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1110~0.offset, ~y~0, ULTIMATE.start_main_~#t1108~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1109~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:13:21,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1109~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1109~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t1109~0.offset_8| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9|) |v_ULTIMATE.start_main_~#t1109~0.offset_8| 1))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1109~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1109~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1109~0.base, #length] because there is no mapped edge [2019-12-27 21:13:21,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10|) |v_ULTIMATE.start_main_~#t1110~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1110~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1110~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1110~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1110~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1110~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1110~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 21:13:21,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (= ~y$r_buff0_thd1~0_In-1032094316 ~y$r_buff1_thd1~0_Out-1032094316) (= ~z~0_Out-1032094316 1) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1032094316 0)) (= ~__unbuffered_p2_EBX~0_Out-1032094316 ~a~0_In-1032094316) (= ~y$r_buff1_thd2~0_Out-1032094316 ~y$r_buff0_thd2~0_In-1032094316) (= ~y$r_buff1_thd3~0_Out-1032094316 ~y$r_buff0_thd3~0_In-1032094316) (= ~y$r_buff1_thd0~0_Out-1032094316 ~y$r_buff0_thd0~0_In-1032094316) (= ~z~0_Out-1032094316 ~__unbuffered_p2_EAX~0_Out-1032094316) (= 1 ~y$r_buff0_thd3~0_Out-1032094316)) InVars {~a~0=~a~0_In-1032094316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1032094316, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1032094316, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1032094316, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1032094316, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1032094316} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1032094316, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1032094316, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1032094316, ~a~0=~a~0_In-1032094316, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1032094316, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1032094316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1032094316, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1032094316, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1032094316, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1032094316, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1032094316, ~z~0=~z~0_Out-1032094316, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1032094316} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:13:21,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 21:13:21,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1682812259| |P1Thread1of1ForFork0_#t~ite3_Out-1682812259|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1682812259 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1682812259 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In-1682812259 |P1Thread1of1ForFork0_#t~ite3_Out-1682812259|)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-1682812259| ~y$w_buff1~0_In-1682812259) (not .cse1) (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1682812259, ~y$w_buff1~0=~y$w_buff1~0_In-1682812259, ~y~0=~y~0_In-1682812259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1682812259} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1682812259, ~y$w_buff1~0=~y$w_buff1~0_In-1682812259, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1682812259|, ~y~0=~y~0_In-1682812259, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1682812259|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1682812259} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:13:21,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1400273227 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1400273227 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite11_Out1400273227|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1400273227 |P2Thread1of1ForFork1_#t~ite11_Out1400273227|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1400273227, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1400273227} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1400273227, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1400273227|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1400273227} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:13:21,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2039518954 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2039518954 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2039518954 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-2039518954 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-2039518954 |P2Thread1of1ForFork1_#t~ite12_Out-2039518954|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out-2039518954|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2039518954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039518954, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2039518954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039518954} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2039518954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039518954, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2039518954, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-2039518954|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039518954} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:13:21,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1827756332 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1827756332 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out1827756332 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out1827756332 ~y$r_buff0_thd3~0_In1827756332) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1827756332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1827756332} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1827756332|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1827756332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1827756332} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 21:13:21,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In1149405393 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1149405393 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1149405393 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1149405393 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out1149405393|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite14_Out1149405393| ~y$r_buff1_thd3~0_In1149405393) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1149405393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1149405393, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1149405393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1149405393} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1149405393|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1149405393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1149405393, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1149405393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1149405393} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:13:21,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 21:13:21,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1678065001 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1678065001 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1678065001|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1678065001 |P1Thread1of1ForFork0_#t~ite5_Out1678065001|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1678065001, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1678065001} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1678065001, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1678065001, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1678065001|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:13:21,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In386230949 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In386230949 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In386230949 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In386230949 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out386230949| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite6_Out386230949| ~y$w_buff1_used~0_In386230949)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In386230949, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386230949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In386230949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386230949} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In386230949, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386230949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In386230949, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out386230949|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386230949} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:13:21,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-84172787 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-84172787 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-84172787| ~y$r_buff0_thd2~0_In-84172787)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-84172787| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-84172787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-84172787} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-84172787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-84172787, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-84172787|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:13:21,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In461462491 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In461462491 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In461462491 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In461462491 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite8_Out461462491|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In461462491 |P1Thread1of1ForFork0_#t~ite8_Out461462491|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In461462491, ~y$w_buff0_used~0=~y$w_buff0_used~0_In461462491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In461462491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461462491} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In461462491, ~y$w_buff0_used~0=~y$w_buff0_used~0_In461462491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In461462491, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out461462491|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461462491} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:13:21,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 21:13:21,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:13:21,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1365166295 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1365166295 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out1365166295| |ULTIMATE.start_main_#t~ite19_Out1365166295|))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out1365166295| ~y~0_In1365166295) (or .cse0 .cse1) .cse2) (and (= ~y$w_buff1~0_In1365166295 |ULTIMATE.start_main_#t~ite18_Out1365166295|) (not .cse0) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1365166295, ~y~0=~y~0_In1365166295, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1365166295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1365166295} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1365166295, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1365166295|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1365166295|, ~y~0=~y~0_In1365166295, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1365166295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1365166295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:13:21,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1867879563 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1867879563 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out1867879563|)) (and (= ~y$w_buff0_used~0_In1867879563 |ULTIMATE.start_main_#t~ite20_Out1867879563|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1867879563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1867879563} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1867879563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1867879563, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1867879563|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:13:21,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1034112489 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1034112489 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1034112489 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1034112489 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1034112489 |ULTIMATE.start_main_#t~ite21_Out-1034112489|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1034112489|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034112489, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1034112489, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1034112489, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034112489} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034112489, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1034112489, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1034112489|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1034112489, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034112489} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:13:21,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In537712156 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In537712156 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out537712156| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out537712156| ~y$r_buff0_thd0~0_In537712156)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In537712156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In537712156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In537712156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In537712156, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out537712156|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:13:21,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In338560648 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In338560648 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In338560648 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In338560648 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out338560648| 0)) (and (= |ULTIMATE.start_main_#t~ite23_Out338560648| ~y$r_buff1_thd0~0_In338560648) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In338560648, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In338560648, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In338560648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In338560648} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In338560648, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In338560648, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In338560648, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out338560648|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In338560648} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:13:21,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In55458481 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out55458481| ~y$w_buff0~0_In55458481) (= |ULTIMATE.start_main_#t~ite29_Out55458481| |ULTIMATE.start_main_#t~ite30_Out55458481|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In55458481 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In55458481 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In55458481 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In55458481 256)) .cse0))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out55458481| ~y$w_buff0~0_In55458481) (= |ULTIMATE.start_main_#t~ite29_In55458481| |ULTIMATE.start_main_#t~ite29_Out55458481|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In55458481, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In55458481|, ~y$w_buff0~0=~y$w_buff0~0_In55458481, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In55458481, ~weak$$choice2~0=~weak$$choice2~0_In55458481, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In55458481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In55458481} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out55458481|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In55458481, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out55458481|, ~y$w_buff0~0=~y$w_buff0~0_In55458481, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In55458481, ~weak$$choice2~0=~weak$$choice2~0_In55458481, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In55458481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In55458481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 21:13:21,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In728872103 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out728872103| |ULTIMATE.start_main_#t~ite35_Out728872103|) (= |ULTIMATE.start_main_#t~ite35_Out728872103| ~y$w_buff0_used~0_In728872103) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In728872103 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In728872103 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In728872103 256)) (and (= 0 (mod ~y$w_buff1_used~0_In728872103 256)) .cse0))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out728872103| ~y$w_buff0_used~0_In728872103) (= |ULTIMATE.start_main_#t~ite35_In728872103| |ULTIMATE.start_main_#t~ite35_Out728872103|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In728872103, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In728872103, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In728872103|, ~weak$$choice2~0=~weak$$choice2~0_In728872103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In728872103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In728872103} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In728872103, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In728872103, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out728872103|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out728872103|, ~weak$$choice2~0=~weak$$choice2~0_In728872103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In728872103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In728872103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:13:21,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In73141477 256)))) (or (and (= ~y$w_buff1_used~0_In73141477 |ULTIMATE.start_main_#t~ite38_Out73141477|) (= |ULTIMATE.start_main_#t~ite39_Out73141477| |ULTIMATE.start_main_#t~ite38_Out73141477|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In73141477 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In73141477 256) 0)) (and (= 0 (mod ~y$r_buff1_thd0~0_In73141477 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In73141477 256)))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In73141477| |ULTIMATE.start_main_#t~ite38_Out73141477|) (= ~y$w_buff1_used~0_In73141477 |ULTIMATE.start_main_#t~ite39_Out73141477|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In73141477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In73141477, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In73141477|, ~weak$$choice2~0=~weak$$choice2~0_In73141477, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In73141477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In73141477} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In73141477, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out73141477|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In73141477, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out73141477|, ~weak$$choice2~0=~weak$$choice2~0_In73141477, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In73141477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In73141477} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:13:21,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} 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 21:13:21,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse5 (= (mod ~y$w_buff1_used~0_In545008567 256) 0)) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In545008567 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In545008567 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In545008567 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite45_Out545008567| |ULTIMATE.start_main_#t~ite44_Out545008567|)) (.cse0 (= (mod ~weak$$choice2~0_In545008567 256) 0))) (or (let ((.cse3 (not .cse6))) (and .cse0 .cse1 (= 0 |ULTIMATE.start_main_#t~ite43_Out545008567|) (or (not .cse2) .cse3) (not .cse4) (= |ULTIMATE.start_main_#t~ite44_Out545008567| |ULTIMATE.start_main_#t~ite43_Out545008567|) (or (not .cse5) .cse3))) (and (or (and (or (and .cse6 .cse5) .cse4 (and .cse6 .cse2)) .cse0 .cse1 (= ~y$r_buff1_thd0~0_In545008567 |ULTIMATE.start_main_#t~ite44_Out545008567|)) (and (not .cse0) (= ~y$r_buff1_thd0~0_In545008567 |ULTIMATE.start_main_#t~ite45_Out545008567|) (= |ULTIMATE.start_main_#t~ite44_In545008567| |ULTIMATE.start_main_#t~ite44_Out545008567|))) (= |ULTIMATE.start_main_#t~ite43_In545008567| |ULTIMATE.start_main_#t~ite43_Out545008567|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In545008567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545008567, ~weak$$choice2~0=~weak$$choice2~0_In545008567, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In545008567|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545008567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545008567, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In545008567|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In545008567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545008567, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out545008567|, ~weak$$choice2~0=~weak$$choice2~0_In545008567, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545008567, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out545008567|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out545008567|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545008567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:13:21,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, 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 21:13:21,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:13:21,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:13:21 BasicIcfg [2019-12-27 21:13:21,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:13:21,756 INFO L168 Benchmark]: Toolchain (without parser) took 30633.79 ms. Allocated memory was 138.9 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 100.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 186.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:21,757 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 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 21:13:21,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.94 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 156.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:21,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.60 ms. Allocated memory is still 203.4 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:21,760 INFO L168 Benchmark]: Boogie Preprocessor took 39.90 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:21,760 INFO L168 Benchmark]: RCFGBuilder took 878.74 ms. Allocated memory is still 203.4 MB. Free memory was 150.6 MB in the beginning and 103.6 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:21,761 INFO L168 Benchmark]: TraceAbstraction took 28812.74 ms. Allocated memory was 203.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:21,765 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 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 818.94 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 156.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.60 ms. Allocated memory is still 203.4 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.90 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 878.74 ms. Allocated memory is still 203.4 MB. Free memory was 150.6 MB in the beginning and 103.6 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28812.74 ms. Allocated memory was 203.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L814] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L816] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] 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_p0_EAX=0, __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=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] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, 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] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, 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] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, 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] [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, 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] [L833] 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_p0_EAX=0, __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=1, 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] [L833] 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) [L834] 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)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, 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] [L835] 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)) [L836] 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)) [L837] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, 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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1901 SDtfs, 2229 SDslu, 4359 SDs, 0 SdLazy, 2525 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 34 SyntacticMatches, 17 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35296occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 47663 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 96945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...