/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:01:20,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:01:20,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:01:20,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:01:20,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:01:20,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:01:20,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:01:20,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:01:20,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:01:20,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:01:20,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:01:20,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:01:20,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:01:20,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:01:20,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:01:20,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:01:20,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:01:20,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:01:20,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:01:20,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:01:20,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:01:20,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:01:20,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:01:20,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:01:20,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:01:20,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:01:20,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:01:20,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:01:20,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:01:20,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:01:20,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:01:20,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:01:20,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:01:20,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:01:20,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:01:20,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:01:20,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:01:20,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:01:20,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:01:20,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:01:20,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:01:20,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:01:20,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:01:20,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:01:20,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:01:20,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:01:20,979 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:01:20,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:01:20,980 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:01:20,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:01:20,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:01:20,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:01:20,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:01:20,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:01:20,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:01:20,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:01:20,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:01:20,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:01:20,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:01:20,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:01:20,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:01:20,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:01:20,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:01:20,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:01:20,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:01:20,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:01:20,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:01:20,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:01:20,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:01:20,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:01:20,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:01:21,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:01:21,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:01:21,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:01:21,276 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:01:21,276 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:01:21,277 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-18 18:01:21,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6ba2289/cf5127ea701542e2af112e541ae4b03a/FLAG6447b3e84 [2019-12-18 18:01:21,946 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:01:21,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-18 18:01:21,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6ba2289/cf5127ea701542e2af112e541ae4b03a/FLAG6447b3e84 [2019-12-18 18:01:22,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6ba2289/cf5127ea701542e2af112e541ae4b03a [2019-12-18 18:01:22,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:01:22,270 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:01:22,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:01:22,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:01:22,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:01:22,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:01:22" (1/1) ... [2019-12-18 18:01:22,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7820f996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:22, skipping insertion in model container [2019-12-18 18:01:22,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:01:22" (1/1) ... [2019-12-18 18:01:22,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:01:22,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:01:22,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:01:22,944 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:01:23,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:01:23,104 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:01:23,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23 WrapperNode [2019-12-18 18:01:23,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:01:23,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:01:23,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:01:23,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:01:23,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:01:23,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:01:23,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:01:23,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:01:23,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (1/1) ... [2019-12-18 18:01:23,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:01:23,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:01:23,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:01:23,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:01:23,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (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 18:01:23,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:01:23,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:01:23,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:01:23,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:01:23,286 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:01:23,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:01:23,287 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:01:23,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:01:23,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:01:23,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:01:23,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:01:23,290 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 18:01:24,026 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:01:24,027 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:01:24,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:01:24 BoogieIcfgContainer [2019-12-18 18:01:24,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:01:24,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:01:24,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:01:24,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:01:24,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:01:22" (1/3) ... [2019-12-18 18:01:24,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbbd8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:01:24, skipping insertion in model container [2019-12-18 18:01:24,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:23" (2/3) ... [2019-12-18 18:01:24,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbbd8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:01:24, skipping insertion in model container [2019-12-18 18:01:24,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:01:24" (3/3) ... [2019-12-18 18:01:24,040 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2019-12-18 18:01:24,051 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:01:24,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:01:24,059 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:01:24,061 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:01:24,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,108 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:24,169 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:01:24,188 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:01:24,188 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:01:24,189 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:01:24,189 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:01:24,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:01:24,189 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:01:24,189 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:01:24,190 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:01:24,207 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 18:01:24,210 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:01:24,299 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:01:24,299 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:01:24,314 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 18:01:24,331 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:01:24,369 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:01:24,370 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:01:24,376 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 18:01:24,388 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 18:01:24,389 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:01:28,961 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 18:01:29,064 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 18:01:29,090 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50487 [2019-12-18 18:01:29,099 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 18:01:29,103 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-18 18:01:29,666 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-18 18:01:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-18 18:01:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:01:29,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:29,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:01:29,679 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:29,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 692929394, now seen corresponding path program 1 times [2019-12-18 18:01:29,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:29,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361326560] [2019-12-18 18:01:29,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:01:29,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361326560] [2019-12-18 18:01:29,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:29,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:01:29,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645038146] [2019-12-18 18:01:29,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:29,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:29,964 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-18 18:01:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:30,270 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-18 18:01:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:30,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:01:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:30,402 INFO L225 Difference]: With dead ends: 9416 [2019-12-18 18:01:30,402 INFO L226 Difference]: Without dead ends: 9234 [2019-12-18 18:01:30,403 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 18:01:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-18 18:01:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-18 18:01:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-18 18:01:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-18 18:01:30,985 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-18 18:01:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:30,986 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-18 18:01:30,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-18 18:01:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:01:30,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:30,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:30,990 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1820083367, now seen corresponding path program 1 times [2019-12-18 18:01:30,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:30,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954790975] [2019-12-18 18:01:30,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:31,148 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 18:01:31,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954790975] [2019-12-18 18:01:31,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:31,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:31,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976373003] [2019-12-18 18:01:31,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:31,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:31,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:31,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:31,154 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-18 18:01:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:31,597 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-18 18:01:31,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:01:31,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:01:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:31,692 INFO L225 Difference]: With dead ends: 14362 [2019-12-18 18:01:31,693 INFO L226 Difference]: Without dead ends: 14355 [2019-12-18 18:01:31,693 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 18:01:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-18 18:01:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-18 18:01:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-18 18:01:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-18 18:01:32,777 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-18 18:01:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:32,778 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-18 18:01:32,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-18 18:01:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:01:32,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:32,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:32,790 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:32,791 INFO L82 PathProgramCache]: Analyzing trace with hash 417951775, now seen corresponding path program 1 times [2019-12-18 18:01:32,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:32,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891960114] [2019-12-18 18:01:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:32,861 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 18:01:32,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891960114] [2019-12-18 18:01:32,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:32,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:32,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730903442] [2019-12-18 18:01:32,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:32,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:32,864 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-18 18:01:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:32,884 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-18 18:01:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:32,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 18:01:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:32,890 INFO L225 Difference]: With dead ends: 1778 [2019-12-18 18:01:32,890 INFO L226 Difference]: Without dead ends: 1778 [2019-12-18 18:01:32,891 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 18:01:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-18 18:01:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-18 18:01:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-18 18:01:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-18 18:01:32,935 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-18 18:01:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:32,935 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-18 18:01:32,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-18 18:01:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 18:01:32,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:32,938 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 18:01:32,938 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1954901459, now seen corresponding path program 1 times [2019-12-18 18:01:32,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:32,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925890357] [2019-12-18 18:01:32,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:33,050 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 18:01:33,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925890357] [2019-12-18 18:01:33,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:33,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:33,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992218748] [2019-12-18 18:01:33,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:33,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:33,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:33,054 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 4 states. [2019-12-18 18:01:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:33,069 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-18 18:01:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:01:33,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 18:01:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:33,071 INFO L225 Difference]: With dead ends: 371 [2019-12-18 18:01:33,071 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 18:01:33,071 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 18:01:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 18:01:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-18 18:01:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 18:01:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-18 18:01:33,079 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-18 18:01:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:33,079 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-18 18:01:33,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-18 18:01:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:33,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:33,081 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 18:01:33,082 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 798988436, now seen corresponding path program 1 times [2019-12-18 18:01:33,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:33,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92409772] [2019-12-18 18:01:33,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:33,205 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 18:01:33,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92409772] [2019-12-18 18:01:33,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:33,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:33,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530267791] [2019-12-18 18:01:33,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:33,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:33,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:33,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:33,207 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-18 18:01:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:33,258 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-18 18:01:33,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:33,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:01:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:33,260 INFO L225 Difference]: With dead ends: 345 [2019-12-18 18:01:33,260 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 18:01:33,260 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 18:01:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 18:01:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-18 18:01:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 18:01:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-18 18:01:33,267 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-18 18:01:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:33,268 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-18 18:01:33,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-18 18:01:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:33,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:33,269 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 18:01:33,270 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash 112676449, now seen corresponding path program 1 times [2019-12-18 18:01:33,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:33,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836865863] [2019-12-18 18:01:33,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:33,324 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 18:01:33,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836865863] [2019-12-18 18:01:33,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:33,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:33,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656202536] [2019-12-18 18:01:33,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:33,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:33,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:33,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:33,326 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-18 18:01:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:33,365 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-18 18:01:33,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:33,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:01:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:33,367 INFO L225 Difference]: With dead ends: 345 [2019-12-18 18:01:33,367 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 18:01:33,367 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 18:01:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 18:01:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-18 18:01:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 18:01:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-18 18:01:33,374 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-18 18:01:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:33,374 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-18 18:01:33,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-18 18:01:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:33,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:33,376 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 18:01:33,376 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash 107384222, now seen corresponding path program 1 times [2019-12-18 18:01:33,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:33,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418782941] [2019-12-18 18:01:33,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:33,481 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 18:01:33,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418782941] [2019-12-18 18:01:33,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:33,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:01:33,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838078617] [2019-12-18 18:01:33,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:33,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:33,484 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 5 states. [2019-12-18 18:01:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:33,732 INFO L93 Difference]: Finished difference Result 475 states and 866 transitions. [2019-12-18 18:01:33,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:01:33,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 18:01:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:33,734 INFO L225 Difference]: With dead ends: 475 [2019-12-18 18:01:33,734 INFO L226 Difference]: Without dead ends: 475 [2019-12-18 18:01:33,734 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 18:01:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-12-18 18:01:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 360. [2019-12-18 18:01:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-12-18 18:01:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 661 transitions. [2019-12-18 18:01:33,742 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 661 transitions. Word has length 52 [2019-12-18 18:01:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:33,742 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 661 transitions. [2019-12-18 18:01:33,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 661 transitions. [2019-12-18 18:01:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:33,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:33,743 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 18:01:33,744 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2113386594, now seen corresponding path program 2 times [2019-12-18 18:01:33,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:33,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139067395] [2019-12-18 18:01:33,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:33,833 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 18:01:33,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139067395] [2019-12-18 18:01:33,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:33,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:01:33,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320760045] [2019-12-18 18:01:33,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:01:33,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:33,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:01:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:01:33,835 INFO L87 Difference]: Start difference. First operand 360 states and 661 transitions. Second operand 6 states. [2019-12-18 18:01:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:34,221 INFO L93 Difference]: Finished difference Result 462 states and 842 transitions. [2019-12-18 18:01:34,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:01:34,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 18:01:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:34,223 INFO L225 Difference]: With dead ends: 462 [2019-12-18 18:01:34,223 INFO L226 Difference]: Without dead ends: 462 [2019-12-18 18:01:34,223 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 18:01:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-18 18:01:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 395. [2019-12-18 18:01:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-12-18 18:01:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 726 transitions. [2019-12-18 18:01:34,231 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 726 transitions. Word has length 52 [2019-12-18 18:01:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:34,232 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 726 transitions. [2019-12-18 18:01:34,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:01:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 726 transitions. [2019-12-18 18:01:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:34,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:34,233 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 18:01:34,234 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:34,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:34,234 INFO L82 PathProgramCache]: Analyzing trace with hash -517730850, now seen corresponding path program 3 times [2019-12-18 18:01:34,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:34,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661660166] [2019-12-18 18:01:34,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:34,333 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 18:01:34,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661660166] [2019-12-18 18:01:34,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:34,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:01:34,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605379807] [2019-12-18 18:01:34,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:01:34,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:34,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:01:34,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:01:34,336 INFO L87 Difference]: Start difference. First operand 395 states and 726 transitions. Second operand 6 states. [2019-12-18 18:01:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:34,646 INFO L93 Difference]: Finished difference Result 475 states and 833 transitions. [2019-12-18 18:01:34,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:01:34,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 18:01:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:34,648 INFO L225 Difference]: With dead ends: 475 [2019-12-18 18:01:34,649 INFO L226 Difference]: Without dead ends: 475 [2019-12-18 18:01:34,649 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 18:01:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-12-18 18:01:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 379. [2019-12-18 18:01:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 18:01:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 677 transitions. [2019-12-18 18:01:34,657 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 677 transitions. Word has length 52 [2019-12-18 18:01:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:34,658 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 677 transitions. [2019-12-18 18:01:34,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:01:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 677 transitions. [2019-12-18 18:01:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:34,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:34,659 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 18:01:34,660 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash 936446688, now seen corresponding path program 4 times [2019-12-18 18:01:34,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:34,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967613003] [2019-12-18 18:01:34,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:34,761 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 18:01:34,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967613003] [2019-12-18 18:01:34,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:34,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:01:34,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131991812] [2019-12-18 18:01:34,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:34,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:34,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:34,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:34,763 INFO L87 Difference]: Start difference. First operand 379 states and 677 transitions. Second operand 5 states. [2019-12-18 18:01:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:34,817 INFO L93 Difference]: Finished difference Result 669 states and 1186 transitions. [2019-12-18 18:01:34,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:01:34,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 18:01:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:34,819 INFO L225 Difference]: With dead ends: 669 [2019-12-18 18:01:34,819 INFO L226 Difference]: Without dead ends: 307 [2019-12-18 18:01:34,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-18 18:01:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-12-18 18:01:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 18:01:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-18 18:01:34,826 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 52 [2019-12-18 18:01:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:34,826 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-18 18:01:34,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-18 18:01:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:34,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:34,828 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 18:01:34,828 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1118600804, now seen corresponding path program 5 times [2019-12-18 18:01:34,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:34,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068445095] [2019-12-18 18:01:34,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:35,013 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 18:01:35,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068445095] [2019-12-18 18:01:35,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:35,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:01:35,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8518047] [2019-12-18 18:01:35,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:01:35,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:35,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:01:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:35,016 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 7 states. [2019-12-18 18:01:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:35,333 INFO L93 Difference]: Finished difference Result 452 states and 775 transitions. [2019-12-18 18:01:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:01:35,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 18:01:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:35,334 INFO L225 Difference]: With dead ends: 452 [2019-12-18 18:01:35,334 INFO L226 Difference]: Without dead ends: 452 [2019-12-18 18:01:35,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:01:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-18 18:01:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 307. [2019-12-18 18:01:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 18:01:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-18 18:01:35,341 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 52 [2019-12-18 18:01:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:35,341 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-18 18:01:35,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:01:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-18 18:01:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:01:35,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:35,343 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 18:01:35,343 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:35,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:35,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1118119919, now seen corresponding path program 1 times [2019-12-18 18:01:35,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:35,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544407954] [2019-12-18 18:01:35,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:35,411 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 18:01:35,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544407954] [2019-12-18 18:01:35,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:35,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:35,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235628389] [2019-12-18 18:01:35,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:35,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:35,414 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 3 states. [2019-12-18 18:01:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:35,424 INFO L93 Difference]: Finished difference Result 268 states and 457 transitions. [2019-12-18 18:01:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:35,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:01:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:35,425 INFO L225 Difference]: With dead ends: 268 [2019-12-18 18:01:35,425 INFO L226 Difference]: Without dead ends: 268 [2019-12-18 18:01:35,426 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 18:01:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-18 18:01:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-12-18 18:01:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-18 18:01:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 457 transitions. [2019-12-18 18:01:35,431 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 457 transitions. Word has length 53 [2019-12-18 18:01:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:35,431 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 457 transitions. [2019-12-18 18:01:35,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 457 transitions. [2019-12-18 18:01:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:01:35,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:35,432 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 18:01:35,433 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash -167824730, now seen corresponding path program 1 times [2019-12-18 18:01:35,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:35,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317137898] [2019-12-18 18:01:35,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:35,692 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 18:01:35,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317137898] [2019-12-18 18:01:35,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:35,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:01:35,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906577464] [2019-12-18 18:01:35,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:01:35,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:01:35,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:01:35,694 INFO L87 Difference]: Start difference. First operand 268 states and 457 transitions. Second operand 11 states. [2019-12-18 18:01:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:36,351 INFO L93 Difference]: Finished difference Result 375 states and 618 transitions. [2019-12-18 18:01:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:01:36,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-18 18:01:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:36,352 INFO L225 Difference]: With dead ends: 375 [2019-12-18 18:01:36,353 INFO L226 Difference]: Without dead ends: 375 [2019-12-18 18:01:36,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:01:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-18 18:01:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 233. [2019-12-18 18:01:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-18 18:01:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 385 transitions. [2019-12-18 18:01:36,360 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 385 transitions. Word has length 53 [2019-12-18 18:01:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:36,360 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 385 transitions. [2019-12-18 18:01:36,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:01:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 385 transitions. [2019-12-18 18:01:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:01:36,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:36,361 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 18:01:36,362 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash 175082296, now seen corresponding path program 2 times [2019-12-18 18:01:36,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:36,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894116774] [2019-12-18 18:01:36,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:36,423 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 18:01:36,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894116774] [2019-12-18 18:01:36,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:36,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:36,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798905669] [2019-12-18 18:01:36,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:36,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:36,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:36,426 INFO L87 Difference]: Start difference. First operand 233 states and 385 transitions. Second operand 3 states. [2019-12-18 18:01:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:36,469 INFO L93 Difference]: Finished difference Result 232 states and 383 transitions. [2019-12-18 18:01:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:36,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:01:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:36,470 INFO L225 Difference]: With dead ends: 232 [2019-12-18 18:01:36,471 INFO L226 Difference]: Without dead ends: 232 [2019-12-18 18:01:36,471 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 18:01:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-18 18:01:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 183. [2019-12-18 18:01:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-18 18:01:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 299 transitions. [2019-12-18 18:01:36,475 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 299 transitions. Word has length 53 [2019-12-18 18:01:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:36,476 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 299 transitions. [2019-12-18 18:01:36,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 299 transitions. [2019-12-18 18:01:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:01:36,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:36,477 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 18:01:36,477 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:36,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:36,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1455781027, now seen corresponding path program 1 times [2019-12-18 18:01:36,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:36,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726303276] [2019-12-18 18:01:36,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:01:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:01:36,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:01:36,627 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:01:36,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= 0 v_~x$read_delayed_var~0.offset_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1591~0.base_19|) (= |v_#NULL.offset_7| 0) (= v_~x$r_buff1_thd2~0_98 0) (= |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19| 1)) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19|) |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0)) |v_#memory_int_17|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| 4) |v_#length_17|) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19|)) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_~#t1591~0.base=|v_ULTIMATE.start_main_~#t1591~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y~0=v_~y~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_~#t1591~0.offset=|v_ULTIMATE.start_main_~#t1591~0.offset_14|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~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, ULTIMATE.start_main_~#t1592~0.base, #length, ULTIMATE.start_main_~#t1592~0.offset, ~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_~#t1591~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1591~0.offset, 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_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:01:36,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1592~0.base_10| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1592~0.offset_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10|) |v_ULTIMATE.start_main_~#t1592~0.offset_9| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1592~0.offset, #length] because there is no mapped edge [2019-12-18 18:01:36,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= ~x$r_buff0_thd2~0_Out1174141955 1) (= ~y~0_Out1174141955 ~__unbuffered_p1_EBX~0_Out1174141955) (= ~y~0_Out1174141955 ~__unbuffered_p1_EAX~0_Out1174141955) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1174141955 0)) (= ~x$r_buff1_thd0~0_Out1174141955 ~x$r_buff0_thd0~0_In1174141955) (= ~x$r_buff1_thd2~0_Out1174141955 ~x$r_buff0_thd2~0_In1174141955) (= ~y~0_Out1174141955 1) (= ~x$r_buff0_thd1~0_In1174141955 ~x$r_buff1_thd1~0_Out1174141955)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1174141955, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1174141955, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1174141955, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1174141955} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1174141955, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1174141955, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1174141955, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1174141955, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1174141955, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1174141955, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1174141955, ~y~0=~y~0_Out1174141955, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1174141955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1174141955} 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 18:01:36,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In510324926 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In510324926 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out510324926| ~x$w_buff1~0_In510324926) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out510324926| ~x~0_In510324926)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In510324926, ~x$w_buff1_used~0=~x$w_buff1_used~0_In510324926, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In510324926, ~x~0=~x~0_In510324926} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out510324926|, ~x$w_buff1~0=~x$w_buff1~0_In510324926, ~x$w_buff1_used~0=~x$w_buff1_used~0_In510324926, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In510324926, ~x~0=~x~0_In510324926} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-18 18:01:36,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_16|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_16|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_15|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-18 18:01:36,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In816223371 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In816223371 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out816223371| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out816223371| ~x$w_buff0_used~0_In816223371)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In816223371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In816223371} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out816223371|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In816223371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In816223371} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:01:36,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In319157681 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In319157681 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In319157681 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In319157681 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In319157681 |P0Thread1of1ForFork0_#t~ite6_Out319157681|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out319157681|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In319157681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In319157681, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In319157681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In319157681} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out319157681|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In319157681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In319157681, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In319157681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In319157681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:01:36,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-483137034 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-483137034 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-483137034 |P0Thread1of1ForFork0_#t~ite7_Out-483137034|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-483137034|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-483137034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-483137034} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-483137034, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-483137034|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-483137034} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:01:36,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-845007752 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-845007752 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-845007752| ~x$w_buff0_used~0_In-845007752)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-845007752| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-845007752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-845007752} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-845007752|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-845007752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-845007752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:01:36,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1566520241 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1566520241 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1566520241 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1566520241 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1566520241 |P1Thread1of1ForFork1_#t~ite12_Out1566520241|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1566520241|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1566520241, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1566520241, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1566520241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1566520241} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1566520241, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1566520241, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1566520241|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1566520241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1566520241} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:01:36,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-288895568 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-288895568 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-288895568 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-288895568 ~x$r_buff0_thd2~0_In-288895568) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-288895568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288895568} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-288895568|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-288895568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288895568} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:01:36,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-749518112 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-749518112 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-749518112 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-749518112 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-749518112| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-749518112| ~x$r_buff1_thd2~0_In-749518112)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-749518112, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-749518112, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-749518112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-749518112} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-749518112, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-749518112, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-749518112, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-749518112|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-749518112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:01:36,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, 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 18:01:36,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-364455877 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-364455877 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-364455877 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-364455877 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-364455877|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd1~0_In-364455877 |P0Thread1of1ForFork0_#t~ite8_Out-364455877|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-364455877, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-364455877, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-364455877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-364455877} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-364455877, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-364455877|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-364455877, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-364455877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-364455877} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:01:36,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} 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 18:01:36,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:01:36,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In2110507781 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In2110507781 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In2110507781 |ULTIMATE.start_main_#t~ite17_Out2110507781|) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In2110507781 |ULTIMATE.start_main_#t~ite17_Out2110507781|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2110507781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2110507781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2110507781, ~x~0=~x~0_In2110507781} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out2110507781|, ~x$w_buff1~0=~x$w_buff1~0_In2110507781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2110507781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2110507781, ~x~0=~x~0_In2110507781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 18:01:36,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 18:01:36,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1908166406 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1908166406 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1908166406| ~x$w_buff0_used~0_In-1908166406) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1908166406| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1908166406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1908166406} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1908166406, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1908166406|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1908166406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 18:01:36,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In961094240 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In961094240 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In961094240 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In961094240 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In961094240 |ULTIMATE.start_main_#t~ite20_Out961094240|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out961094240|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In961094240, ~x$w_buff1_used~0=~x$w_buff1_used~0_In961094240, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In961094240, ~x$w_buff0_used~0=~x$w_buff0_used~0_In961094240} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In961094240, ~x$w_buff1_used~0=~x$w_buff1_used~0_In961094240, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out961094240|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In961094240, ~x$w_buff0_used~0=~x$w_buff0_used~0_In961094240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 18:01:36,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In331303270 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In331303270 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out331303270|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In331303270 |ULTIMATE.start_main_#t~ite21_Out331303270|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In331303270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In331303270} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In331303270, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out331303270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In331303270} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 18:01:36,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2137251113 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2137251113 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2137251113 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-2137251113 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-2137251113 |ULTIMATE.start_main_#t~ite22_Out-2137251113|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-2137251113|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137251113, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2137251113, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2137251113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137251113} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137251113, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2137251113, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2137251113, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2137251113|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137251113} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 18:01:36,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} 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 18:01:36,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, 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 18:01:36,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] 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 18:01:36,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:01:36 BasicIcfg [2019-12-18 18:01:36,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:01:36,766 INFO L168 Benchmark]: Toolchain (without parser) took 14495.69 ms. Allocated memory was 139.5 MB in the beginning and 595.1 MB in the end (delta: 455.6 MB). Free memory was 101.0 MB in the beginning and 354.7 MB in the end (delta: -253.7 MB). Peak memory consumption was 201.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:36,766 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:01:36,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.85 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 158.0 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:36,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.53 ms. Allocated memory is still 203.9 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:36,771 INFO L168 Benchmark]: Boogie Preprocessor took 36.15 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:36,772 INFO L168 Benchmark]: RCFGBuilder took 819.18 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 108.6 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:36,773 INFO L168 Benchmark]: TraceAbstraction took 12732.66 ms. Allocated memory was 203.9 MB in the beginning and 595.1 MB in the end (delta: 391.1 MB). Free memory was 108.6 MB in the beginning and 354.7 MB in the end (delta: -246.1 MB). Peak memory consumption was 145.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:36,777 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.85 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 158.0 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.53 ms. Allocated memory is still 203.9 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.15 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.18 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 108.6 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12732.66 ms. Allocated memory was 203.9 MB in the beginning and 595.1 MB in the end (delta: 391.1 MB). Free memory was 108.6 MB in the beginning and 354.7 MB in the end (delta: -246.1 MB). Peak memory consumption was 145.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3783 VarBasedMoverChecksPositive, 170 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 202 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 50487 CheckedPairsTotal, 98 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(&t1591, ((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(&t1592, ((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: 12.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1445 SDtfs, 834 SDslu, 2390 SDs, 0 SdLazy, 1629 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 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.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1974 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 70525 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...