/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:58:09,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:58:09,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:58:09,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:58:09,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:58:09,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:58:09,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:58:09,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:58:09,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:58:09,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:58:09,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:58:09,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:58:09,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:58:09,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:58:09,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:58:09,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:58:09,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:58:09,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:58:09,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:58:09,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:58:09,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:58:10,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:58:10,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:58:10,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:58:10,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:58:10,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:58:10,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:58:10,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:58:10,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:58:10,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:58:10,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:58:10,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:58:10,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:58:10,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:58:10,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:58:10,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:58:10,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:58:10,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:58:10,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:58:10,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:58:10,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:58:10,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:58:10,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:58:10,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:58:10,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:58:10,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:58:10,032 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:58:10,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:58:10,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:58:10,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:58:10,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:58:10,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:58:10,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:58:10,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:58:10,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:58:10,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:58:10,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:58:10,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:58:10,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:58:10,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:58:10,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:58:10,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:58:10,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:58:10,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:58:10,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:58:10,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:58:10,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:58:10,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:58:10,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:58:10,036 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:58:10,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:58:10,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:58:10,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:58:10,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:58:10,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:58:10,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:58:10,329 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:58:10,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-18 21:58:10,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd4d49f3/dfec197710054b02b7c18a3f2787bbb5/FLAGf98873d4c [2019-12-18 21:58:10,951 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:58:10,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-18 21:58:10,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd4d49f3/dfec197710054b02b7c18a3f2787bbb5/FLAGf98873d4c [2019-12-18 21:58:11,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd4d49f3/dfec197710054b02b7c18a3f2787bbb5 [2019-12-18 21:58:11,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:58:11,259 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:58:11,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:58:11,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:58:11,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:58:11,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:58:11" (1/1) ... [2019-12-18 21:58:11,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@500bc0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:11, skipping insertion in model container [2019-12-18 21:58:11,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:58:11" (1/1) ... [2019-12-18 21:58:11,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:58:11,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:58:11,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:58:11,913 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:58:11,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:58:12,053 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:58:12,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12 WrapperNode [2019-12-18 21:58:12,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:58:12,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:58:12,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:58:12,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:58:12,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:58:12,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:58:12,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:58:12,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:58:12,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... [2019-12-18 21:58:12,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:58:12,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:58:12,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:58:12,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:58:12,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:58:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:58:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:58:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:58:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:58:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:58:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:58:12,240 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:58:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:58:12,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:58:12,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:58:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:58:12,242 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:58:12,879 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:58:12,879 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:58:12,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:58:12 BoogieIcfgContainer [2019-12-18 21:58:12,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:58:12,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:58:12,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:58:12,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:58:12,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:58:11" (1/3) ... [2019-12-18 21:58:12,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa46db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:58:12, skipping insertion in model container [2019-12-18 21:58:12,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:12" (2/3) ... [2019-12-18 21:58:12,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa46db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:58:12, skipping insertion in model container [2019-12-18 21:58:12,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:58:12" (3/3) ... [2019-12-18 21:58:12,889 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2019-12-18 21:58:12,900 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:58:12,900 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:58:12,908 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:58:12,910 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:58:12,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,947 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,976 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,976 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:12,996 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:58:13,018 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:58:13,018 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:58:13,019 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:58:13,019 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:58:13,019 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:58:13,019 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:58:13,019 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:58:13,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:58:13,055 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 21:58:13,057 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:58:13,131 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:58:13,132 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:58:13,150 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:58:13,170 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:58:13,210 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:58:13,210 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:58:13,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:58:13,230 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 21:58:13,231 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:58:16,043 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 21:58:16,148 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 21:58:16,166 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51265 [2019-12-18 21:58:16,166 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-18 21:58:16,170 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-18 21:58:16,696 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-18 21:58:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-18 21:58:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:58:16,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:16,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:58:16,706 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:16,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash 691080428, now seen corresponding path program 1 times [2019-12-18 21:58:16,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:16,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282961016] [2019-12-18 21:58:16,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:16,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282961016] [2019-12-18 21:58:16,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:16,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:58:16,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920525757] [2019-12-18 21:58:16,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:16,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:17,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:17,006 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-18 21:58:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:17,342 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-18 21:58:17,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:17,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:58:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:17,451 INFO L225 Difference]: With dead ends: 9416 [2019-12-18 21:58:17,451 INFO L226 Difference]: Without dead ends: 9234 [2019-12-18 21:58:17,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-18 21:58:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-18 21:58:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-18 21:58:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-18 21:58:17,941 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-18 21:58:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:17,942 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-18 21:58:17,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-18 21:58:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:58:17,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:17,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:17,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:17,946 INFO L82 PathProgramCache]: Analyzing trace with hash -530442671, now seen corresponding path program 1 times [2019-12-18 21:58:17,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:17,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257947379] [2019-12-18 21:58:18,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:18,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257947379] [2019-12-18 21:58:18,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:18,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:18,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962611488] [2019-12-18 21:58:18,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:58:18,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:18,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:58:18,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:58:18,198 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-18 21:58:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:18,647 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-18 21:58:18,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:58:18,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:58:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:18,741 INFO L225 Difference]: With dead ends: 14362 [2019-12-18 21:58:18,742 INFO L226 Difference]: Without dead ends: 14355 [2019-12-18 21:58:18,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:58:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-18 21:58:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-18 21:58:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-18 21:58:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-18 21:58:19,486 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-18 21:58:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:19,486 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-18 21:58:19,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:58:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-18 21:58:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:58:19,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:19,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:19,492 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash -963171175, now seen corresponding path program 1 times [2019-12-18 21:58:19,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:19,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340464185] [2019-12-18 21:58:19,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:19,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340464185] [2019-12-18 21:58:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:19,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:19,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847121] [2019-12-18 21:58:19,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:19,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:19,551 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-18 21:58:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:19,587 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-18 21:58:19,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:19,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:58:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:19,594 INFO L225 Difference]: With dead ends: 1778 [2019-12-18 21:58:19,594 INFO L226 Difference]: Without dead ends: 1778 [2019-12-18 21:58:19,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-18 21:58:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-18 21:58:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-18 21:58:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-18 21:58:19,659 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-18 21:58:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:19,659 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-18 21:58:19,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-18 21:58:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 21:58:19,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:19,666 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] [2019-12-18 21:58:19,666 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash 966140781, now seen corresponding path program 1 times [2019-12-18 21:58:19,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:19,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196314320] [2019-12-18 21:58:19,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:19,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196314320] [2019-12-18 21:58:19,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:19,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:19,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633262444] [2019-12-18 21:58:19,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:58:19,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:58:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:58:19,785 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 4 states. [2019-12-18 21:58:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:19,806 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-18 21:58:19,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:58:19,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 21:58:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:19,808 INFO L225 Difference]: With dead ends: 371 [2019-12-18 21:58:19,808 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 21:58:19,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:58:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 21:58:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-18 21:58:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 21:58:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-18 21:58:19,818 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-18 21:58:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:19,819 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-18 21:58:19,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:58:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-18 21:58:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:58:19,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:19,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:19,822 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash -813009935, now seen corresponding path program 1 times [2019-12-18 21:58:19,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:19,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811874730] [2019-12-18 21:58:19,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:19,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811874730] [2019-12-18 21:58:19,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:19,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:19,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329486494] [2019-12-18 21:58:19,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:19,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:19,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:19,956 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-18 21:58:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:20,015 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-18 21:58:20,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:20,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:58:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:20,017 INFO L225 Difference]: With dead ends: 345 [2019-12-18 21:58:20,017 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 21:58:20,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 21:58:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-18 21:58:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 21:58:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-18 21:58:20,027 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-18 21:58:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:20,028 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-18 21:58:20,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-18 21:58:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:58:20,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:20,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:20,032 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1499321922, now seen corresponding path program 1 times [2019-12-18 21:58:20,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:20,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300882555] [2019-12-18 21:58:20,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:20,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300882555] [2019-12-18 21:58:20,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:20,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:20,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922162977] [2019-12-18 21:58:20,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:20,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:20,144 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-18 21:58:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:20,207 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-18 21:58:20,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:20,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:58:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:20,209 INFO L225 Difference]: With dead ends: 345 [2019-12-18 21:58:20,210 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 21:58:20,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 21:58:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-18 21:58:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 21:58:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-18 21:58:20,221 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-18 21:58:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:20,224 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-18 21:58:20,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-18 21:58:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:58:20,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:20,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:20,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1504614149, now seen corresponding path program 1 times [2019-12-18 21:58:20,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:20,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088517708] [2019-12-18 21:58:20,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:20,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088517708] [2019-12-18 21:58:20,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:20,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:58:20,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110101733] [2019-12-18 21:58:20,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:58:20,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:58:20,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:58:20,370 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 5 states. [2019-12-18 21:58:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:20,714 INFO L93 Difference]: Finished difference Result 475 states and 866 transitions. [2019-12-18 21:58:20,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:58:20,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 21:58:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:20,716 INFO L225 Difference]: With dead ends: 475 [2019-12-18 21:58:20,716 INFO L226 Difference]: Without dead ends: 475 [2019-12-18 21:58:20,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:58:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-12-18 21:58:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 360. [2019-12-18 21:58:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-12-18 21:58:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 661 transitions. [2019-12-18 21:58:20,728 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 661 transitions. Word has length 52 [2019-12-18 21:58:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:20,728 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 661 transitions. [2019-12-18 21:58:20,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:58:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 661 transitions. [2019-12-18 21:58:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:58:20,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:20,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:20,730 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash -378391557, now seen corresponding path program 2 times [2019-12-18 21:58:20,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:20,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471477042] [2019-12-18 21:58:20,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:20,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471477042] [2019-12-18 21:58:20,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:20,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:58:20,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058198821] [2019-12-18 21:58:20,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:58:20,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:20,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:58:20,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:58:20,932 INFO L87 Difference]: Start difference. First operand 360 states and 661 transitions. Second operand 6 states. [2019-12-18 21:58:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:21,225 INFO L93 Difference]: Finished difference Result 462 states and 842 transitions. [2019-12-18 21:58:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:58:21,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 21:58:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:21,227 INFO L225 Difference]: With dead ends: 462 [2019-12-18 21:58:21,227 INFO L226 Difference]: Without dead ends: 462 [2019-12-18 21:58:21,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:58:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-18 21:58:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 395. [2019-12-18 21:58:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-12-18 21:58:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 726 transitions. [2019-12-18 21:58:21,241 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 726 transitions. Word has length 52 [2019-12-18 21:58:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:21,241 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 726 transitions. [2019-12-18 21:58:21,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:58:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 726 transitions. [2019-12-18 21:58:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:58:21,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:21,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:21,244 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1056283141, now seen corresponding path program 3 times [2019-12-18 21:58:21,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:21,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595113996] [2019-12-18 21:58:21,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:21,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595113996] [2019-12-18 21:58:21,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:21,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:58:21,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342029287] [2019-12-18 21:58:21,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:58:21,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:58:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:58:21,369 INFO L87 Difference]: Start difference. First operand 395 states and 726 transitions. Second operand 6 states. [2019-12-18 21:58:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:21,725 INFO L93 Difference]: Finished difference Result 476 states and 834 transitions. [2019-12-18 21:58:21,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:58:21,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 21:58:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:21,727 INFO L225 Difference]: With dead ends: 476 [2019-12-18 21:58:21,727 INFO L226 Difference]: Without dead ends: 476 [2019-12-18 21:58:21,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:58:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-18 21:58:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 379. [2019-12-18 21:58:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 21:58:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 677 transitions. [2019-12-18 21:58:21,742 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 677 transitions. Word has length 52 [2019-12-18 21:58:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:21,742 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 677 transitions. [2019-12-18 21:58:21,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:58:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 677 transitions. [2019-12-18 21:58:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:58:21,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:21,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:21,745 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:21,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1549888961, now seen corresponding path program 4 times [2019-12-18 21:58:21,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:21,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312388917] [2019-12-18 21:58:21,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:21,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312388917] [2019-12-18 21:58:21,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:21,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:58:21,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183253558] [2019-12-18 21:58:21,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:58:21,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:58:21,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:58:21,885 INFO L87 Difference]: Start difference. First operand 379 states and 677 transitions. Second operand 7 states. [2019-12-18 21:58:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:22,337 INFO L93 Difference]: Finished difference Result 585 states and 1030 transitions. [2019-12-18 21:58:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:58:22,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:58:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:22,339 INFO L225 Difference]: With dead ends: 585 [2019-12-18 21:58:22,340 INFO L226 Difference]: Without dead ends: 585 [2019-12-18 21:58:22,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:58:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-12-18 21:58:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 379. [2019-12-18 21:58:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 21:58:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 677 transitions. [2019-12-18 21:58:22,349 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 677 transitions. Word has length 52 [2019-12-18 21:58:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:22,350 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 677 transitions. [2019-12-18 21:58:22,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:58:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 677 transitions. [2019-12-18 21:58:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:58:22,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:22,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:22,352 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash 305711121, now seen corresponding path program 1 times [2019-12-18 21:58:22,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:22,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130552259] [2019-12-18 21:58:22,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:22,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130552259] [2019-12-18 21:58:22,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:22,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:58:22,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165456718] [2019-12-18 21:58:22,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:58:22,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:58:22,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:58:22,725 INFO L87 Difference]: Start difference. First operand 379 states and 677 transitions. Second operand 9 states. [2019-12-18 21:58:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:23,526 INFO L93 Difference]: Finished difference Result 694 states and 1235 transitions. [2019-12-18 21:58:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:58:23,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 21:58:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:23,530 INFO L225 Difference]: With dead ends: 694 [2019-12-18 21:58:23,530 INFO L226 Difference]: Without dead ends: 694 [2019-12-18 21:58:23,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:58:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-18 21:58:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 379. [2019-12-18 21:58:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 21:58:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 684 transitions. [2019-12-18 21:58:23,542 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 684 transitions. Word has length 53 [2019-12-18 21:58:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:23,542 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 684 transitions. [2019-12-18 21:58:23,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:58:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 684 transitions. [2019-12-18 21:58:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:58:23,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:23,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:23,544 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:23,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:23,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1624929181, now seen corresponding path program 2 times [2019-12-18 21:58:23,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:23,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937575299] [2019-12-18 21:58:23,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:23,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937575299] [2019-12-18 21:58:23,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:23,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:58:23,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627398425] [2019-12-18 21:58:23,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:58:23,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:23,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:58:23,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:58:23,669 INFO L87 Difference]: Start difference. First operand 379 states and 684 transitions. Second operand 6 states. [2019-12-18 21:58:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:23,740 INFO L93 Difference]: Finished difference Result 666 states and 1190 transitions. [2019-12-18 21:58:23,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:58:23,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 21:58:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:23,741 INFO L225 Difference]: With dead ends: 666 [2019-12-18 21:58:23,742 INFO L226 Difference]: Without dead ends: 304 [2019-12-18 21:58:23,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:58:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-18 21:58:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 272. [2019-12-18 21:58:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-12-18 21:58:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 470 transitions. [2019-12-18 21:58:23,748 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 470 transitions. Word has length 53 [2019-12-18 21:58:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:23,749 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 470 transitions. [2019-12-18 21:58:23,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:58:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 470 transitions. [2019-12-18 21:58:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:58:23,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:23,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:23,750 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1313923440, now seen corresponding path program 1 times [2019-12-18 21:58:23,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:23,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509028981] [2019-12-18 21:58:23,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:23,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-18 21:58:23,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509028981] [2019-12-18 21:58:23,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:23,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:23,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324520030] [2019-12-18 21:58:23,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:23,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:23,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:23,850 INFO L87 Difference]: Start difference. First operand 272 states and 470 transitions. Second operand 3 states. [2019-12-18 21:58:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:23,861 INFO L93 Difference]: Finished difference Result 247 states and 418 transitions. [2019-12-18 21:58:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:23,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 21:58:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:23,863 INFO L225 Difference]: With dead ends: 247 [2019-12-18 21:58:23,863 INFO L226 Difference]: Without dead ends: 247 [2019-12-18 21:58:23,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:23,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-18 21:58:23,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-12-18 21:58:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-12-18 21:58:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 418 transitions. [2019-12-18 21:58:23,870 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 418 transitions. Word has length 53 [2019-12-18 21:58:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:23,871 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 418 transitions. [2019-12-18 21:58:23,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 418 transitions. [2019-12-18 21:58:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:58:23,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:23,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:23,872 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:23,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash -92518571, now seen corresponding path program 3 times [2019-12-18 21:58:23,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:23,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467389421] [2019-12-18 21:58:23,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:23,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467389421] [2019-12-18 21:58:23,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:23,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:23,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168331120] [2019-12-18 21:58:23,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:23,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:23,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:23,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:23,944 INFO L87 Difference]: Start difference. First operand 247 states and 418 transitions. Second operand 3 states. [2019-12-18 21:58:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:23,983 INFO L93 Difference]: Finished difference Result 246 states and 416 transitions. [2019-12-18 21:58:23,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:23,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 21:58:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:23,984 INFO L225 Difference]: With dead ends: 246 [2019-12-18 21:58:23,984 INFO L226 Difference]: Without dead ends: 246 [2019-12-18 21:58:23,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-18 21:58:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 197. [2019-12-18 21:58:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-18 21:58:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 332 transitions. [2019-12-18 21:58:23,990 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 332 transitions. Word has length 53 [2019-12-18 21:58:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:23,990 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 332 transitions. [2019-12-18 21:58:23,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions. [2019-12-18 21:58:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:58:23,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:23,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:23,993 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash 599019040, now seen corresponding path program 1 times [2019-12-18 21:58:23,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:23,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73271062] [2019-12-18 21:58:23,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:58:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:58:24,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:58:24,099 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:58:24,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= v_~x$w_buff1_used~0_59 0) (= v_~x$r_buff1_thd1~0_19 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1587~0.base_18|) (= v_~x$flush_delayed~0_15 0) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_21) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1587~0.base_18| 4) |v_#length_15|) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= 0 v_~x$w_buff0~0_24) (= 0 v_~x$r_buff0_thd0~0_77) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_18|)) (= 0 |v_ULTIMATE.start_main_~#t1587~0.offset_13|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_48 0) (= v_~y~0_13 0) (= v_~x$r_buff1_thd2~0_19 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1587~0.base_18| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1587~0.base_18|) |v_ULTIMATE.start_main_~#t1587~0.offset_13| 0)) |v_#memory_int_15|) (= 0 v_~x$r_buff0_thd1~0_21) (= 0 v_~x$r_buff0_thd2~0_28) (= 0 v_~x$w_buff0_used~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_12 0) (= |v_#valid_42| (store .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_18| 1)) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1587~0.offset=|v_ULTIMATE.start_main_~#t1587~0.offset_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_10|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_8|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_8|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_77, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_6|, ~x$w_buff1~0=v_~x$w_buff1~0_21, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_10|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_11|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_16|, ~y~0=v_~y~0_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_10|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_~#t1587~0.base=|v_ULTIMATE.start_main_~#t1587~0.base_18|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1587~0.offset, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1588~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1587~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:58:24,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L787-1-->L789: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1588~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10|) |v_ULTIMATE.start_main_~#t1588~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1588~0.offset_9| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1588~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1588~0.base, #length] because there is no mapped edge [2019-12-18 21:58:24,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L4-->L764: Formula: (and (= ~x$r_buff1_thd0~0_Out2137796820 ~x$r_buff0_thd0~0_In2137796820) (= ~x$r_buff0_thd2~0_Out2137796820 1) (= ~x$r_buff0_thd1~0_In2137796820 ~x$r_buff1_thd1~0_Out2137796820) (= ~x$r_buff1_thd2~0_Out2137796820 ~x$r_buff0_thd2~0_In2137796820) (= ~y~0_Out2137796820 ~__unbuffered_p1_EBX~0_Out2137796820) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In2137796820 0)) (= ~y~0_Out2137796820 ~__unbuffered_p1_EAX~0_Out2137796820) (= ~y~0_Out2137796820 1)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In2137796820, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2137796820, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2137796820, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2137796820} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In2137796820, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2137796820, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2137796820, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out2137796820, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out2137796820, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out2137796820, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out2137796820, ~y~0=~y~0_Out2137796820, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2137796820, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out2137796820} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:58:24,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In1792534505 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1792534505 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In1792534505 |P0Thread1of1ForFork0_#t~ite3_Out1792534505|) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In1792534505 |P0Thread1of1ForFork0_#t~ite3_Out1792534505|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1792534505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1792534505, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1792534505, ~x~0=~x~0_In1792534505} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1792534505|, ~x$w_buff1~0=~x$w_buff1~0_In1792534505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1792534505, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1792534505, ~x~0=~x~0_In1792534505} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-18 21:58:24,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_15 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-18 21:58:24,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In281413280 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In281413280 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out281413280| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out281413280| ~x$w_buff0_used~0_In281413280) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In281413280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In281413280} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out281413280|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In281413280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In281413280} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:58:24,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2045292172 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-2045292172 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-2045292172 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-2045292172 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2045292172 |P0Thread1of1ForFork0_#t~ite6_Out-2045292172|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2045292172|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2045292172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2045292172, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2045292172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2045292172} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2045292172|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2045292172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2045292172, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2045292172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2045292172} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:58:24,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1452904903 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1452904903 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1452904903|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In1452904903 |P0Thread1of1ForFork0_#t~ite7_Out1452904903|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1452904903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1452904903} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1452904903, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1452904903|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1452904903} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:58:24,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In333823433 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In333823433 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out333823433| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out333823433| ~x$w_buff0_used~0_In333823433)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In333823433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In333823433} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out333823433|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In333823433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In333823433} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:58:24,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-877756339 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-877756339 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-877756339 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-877756339 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-877756339| 0)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-877756339| ~x$w_buff1_used~0_In-877756339) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-877756339, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-877756339, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-877756339, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-877756339} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-877756339, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-877756339, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-877756339|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-877756339, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-877756339} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:58:24,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In508366276 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In508366276 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out508366276 0)) (and (= ~x$r_buff0_thd2~0_In508366276 ~x$r_buff0_thd2~0_Out508366276) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In508366276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In508366276} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out508366276|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out508366276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In508366276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:58:24,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1265928681 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1265928681 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1265928681 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1265928681 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1265928681 |P1Thread1of1ForFork1_#t~ite14_Out-1265928681|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1265928681| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1265928681, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1265928681, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1265928681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1265928681} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1265928681, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1265928681, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1265928681, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1265928681|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1265928681} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:58:24,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:58:24,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-213546519 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-213546519 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-213546519 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-213546519 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In-213546519 |P0Thread1of1ForFork0_#t~ite8_Out-213546519|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-213546519|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-213546519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-213546519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-213546519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-213546519} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-213546519, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-213546519|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-213546519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-213546519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-213546519} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:58:24,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L734-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 21:58:24,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:58:24,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1354461058 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1354461058 256)))) (or (and (= ~x~0_In-1354461058 |ULTIMATE.start_main_#t~ite17_Out-1354461058|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-1354461058| ~x$w_buff1~0_In-1354461058) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1354461058, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1354461058, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1354461058, ~x~0=~x~0_In-1354461058} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1354461058|, ~x$w_buff1~0=~x$w_buff1~0_In-1354461058, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1354461058, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1354461058, ~x~0=~x~0_In-1354461058} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 21:58:24,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_18 |v_ULTIMATE.start_main_#t~ite17_7|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_6|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 21:58:24,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1111768838 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1111768838 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out1111768838|)) (and (= ~x$w_buff0_used~0_In1111768838 |ULTIMATE.start_main_#t~ite19_Out1111768838|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1111768838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111768838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1111768838, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1111768838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111768838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:58:24,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-2028499488 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-2028499488 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2028499488 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2028499488 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-2028499488| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out-2028499488| ~x$w_buff1_used~0_In-2028499488) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2028499488, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2028499488, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2028499488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028499488} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2028499488, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2028499488, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2028499488|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2028499488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028499488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:58:24,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2103116822 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2103116822 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In2103116822 |ULTIMATE.start_main_#t~ite21_Out2103116822|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out2103116822|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2103116822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2103116822} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2103116822, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2103116822|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2103116822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:58:24,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1501974157 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1501974157 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1501974157 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1501974157 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In1501974157 |ULTIMATE.start_main_#t~ite22_Out1501974157|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out1501974157| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1501974157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1501974157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1501974157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1501974157} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1501974157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1501974157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1501974157, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1501974157|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1501974157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:58:24,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (= v_~x$r_buff0_thd0~0_69 v_~x$r_buff0_thd0~0_70) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:58:24,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-->L817-1: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= v_~x$mem_tmp~0_6 v_~x~0_22)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_8|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:58:24,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:58:24,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:58:24 BasicIcfg [2019-12-18 21:58:24,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:58:24,213 INFO L168 Benchmark]: Toolchain (without parser) took 12952.37 ms. Allocated memory was 138.9 MB in the beginning and 405.8 MB in the end (delta: 266.9 MB). Free memory was 100.7 MB in the beginning and 92.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 275.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:24,215 INFO L168 Benchmark]: CDTParser took 1.44 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.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:58:24,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.75 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.3 MB in the beginning and 157.1 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:24,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.59 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 153.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:24,219 INFO L168 Benchmark]: Boogie Preprocessor took 43.55 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:24,219 INFO L168 Benchmark]: RCFGBuilder took 714.10 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 107.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:24,223 INFO L168 Benchmark]: TraceAbstraction took 11327.28 ms. Allocated memory was 203.4 MB in the beginning and 405.8 MB in the end (delta: 202.4 MB). Free memory was 106.6 MB in the beginning and 92.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 217.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:24,229 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 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.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.75 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.3 MB in the beginning and 157.1 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.59 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 153.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.55 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 714.10 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 107.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11327.28 ms. Allocated memory was 203.4 MB in the beginning and 405.8 MB in the end (delta: 202.4 MB). Free memory was 106.6 MB in the beginning and 92.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 217.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 24 ChoiceCompositions, 3733 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51265 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1485 SDtfs, 909 SDslu, 2530 SDs, 0 SdLazy, 1897 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 2241 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 73378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...