/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/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:04:08,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:04:08,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:04:08,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:04:08,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:04:08,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:04:08,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:04:08,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:04:08,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:04:08,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:04:08,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:04:08,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:04:08,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:04:08,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:04:08,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:04:08,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:04:09,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:04:09,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:04:09,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:04:09,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:04:09,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:04:09,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:04:09,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:04:09,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:04:09,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:04:09,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:04:09,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:04:09,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:04:09,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:04:09,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:04:09,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:04:09,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:04:09,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:04:09,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:04:09,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:04:09,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:04:09,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:04:09,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:04:09,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:04:09,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:04:09,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:04:09,020 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 19:04:09,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:04:09,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:04:09,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:04:09,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:04:09,036 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:04:09,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:04:09,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:04:09,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:04:09,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:04:09,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:04:09,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:04:09,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:04:09,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:04:09,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:04:09,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:04:09,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:04:09,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:04:09,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:04:09,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:04:09,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:04:09,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:04:09,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:04:09,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:04:09,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:04:09,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:04:09,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:04:09,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:04:09,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:04:09,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:04:09,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:04:09,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:04:09,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:04:09,341 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:04:09,341 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:04:09,342 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-18 19:04:09,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9055d7b/734c5dfb1257461bb3900140f55563d1/FLAG5ab6a6701 [2019-12-18 19:04:10,012 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:04:10,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-18 19:04:10,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9055d7b/734c5dfb1257461bb3900140f55563d1/FLAG5ab6a6701 [2019-12-18 19:04:10,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9055d7b/734c5dfb1257461bb3900140f55563d1 [2019-12-18 19:04:10,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:04:10,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:04:10,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:10,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:04:10,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:04:10,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:10" (1/1) ... [2019-12-18 19:04:10,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:10, skipping insertion in model container [2019-12-18 19:04:10,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:10" (1/1) ... [2019-12-18 19:04:10,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:04:10,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:04:10,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:10,878 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:04:10,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:11,041 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:04:11,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11 WrapperNode [2019-12-18 19:04:11,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:11,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:11,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:04:11,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:04:11,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:11,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:04:11,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:04:11,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:04:11,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (1/1) ... [2019-12-18 19:04:11,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:04:11,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:04:11,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:04:11,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:04:11,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (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 19:04:11,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:04:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:04:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:04:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:04:11,223 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:04:11,224 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:04:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:04:11,224 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:04:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:04:11,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:04:11,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:04:11,227 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 19:04:11,965 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:04:11,965 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:04:11,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:11 BoogieIcfgContainer [2019-12-18 19:04:11,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:04:11,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:04:11,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:04:11,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:04:11,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:04:10" (1/3) ... [2019-12-18 19:04:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362b621f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:11, skipping insertion in model container [2019-12-18 19:04:11,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:11" (2/3) ... [2019-12-18 19:04:11,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362b621f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:11, skipping insertion in model container [2019-12-18 19:04:11,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:11" (3/3) ... [2019-12-18 19:04:11,978 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2019-12-18 19:04:11,989 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:04:11,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:04:12,009 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:04:12,010 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:04:12,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,048 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,048 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,048 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,049 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,049 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,075 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,076 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:12,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:04:12,114 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:04:12,114 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:04:12,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:04:12,115 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:04:12,115 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:04:12,115 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:04:12,115 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:04:12,115 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:04:12,133 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 19:04:12,136 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 19:04:12,230 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 19:04:12,230 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:12,243 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 19:04:12,260 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 19:04:12,297 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 19:04:12,297 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:12,302 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 19:04:12,315 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 19:04:12,317 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:04:16,805 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 19:04:16,931 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 19:04:16,966 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-18 19:04:16,967 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 19:04:16,970 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 19:04:17,441 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-18 19:04:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-18 19:04:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:04:17,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:17,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:04:17,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:17,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-18 19:04:17,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:17,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429016923] [2019-12-18 19:04:17,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:17,686 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 19:04:17,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429016923] [2019-12-18 19:04:17,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:17,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:04:17,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928098686] [2019-12-18 19:04:17,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:17,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:17,711 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-18 19:04:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:17,958 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-18 19:04:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:17,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:04:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:18,094 INFO L225 Difference]: With dead ends: 8394 [2019-12-18 19:04:18,094 INFO L226 Difference]: Without dead ends: 8226 [2019-12-18 19:04:18,096 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 19:04:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-18 19:04:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-18 19:04:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-18 19:04:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-18 19:04:18,520 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-18 19:04:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:18,521 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-18 19:04:18,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-18 19:04:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:04:18,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:18,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:18,525 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-18 19:04:18,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:18,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962952209] [2019-12-18 19:04:18,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:18,749 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 19:04:18,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962952209] [2019-12-18 19:04:18,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:18,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:18,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211774056] [2019-12-18 19:04:18,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:18,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:18,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:18,753 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-18 19:04:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:19,088 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-18 19:04:19,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:19,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:04:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:19,161 INFO L225 Difference]: With dead ends: 12778 [2019-12-18 19:04:19,162 INFO L226 Difference]: Without dead ends: 12771 [2019-12-18 19:04:19,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-18 19:04:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-18 19:04:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-18 19:04:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-18 19:04:20,278 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-18 19:04:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:20,279 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-18 19:04:20,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-18 19:04:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:04:20,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:20,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:20,289 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-18 19:04:20,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:20,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271270351] [2019-12-18 19:04:20,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:20,431 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 19:04:20,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271270351] [2019-12-18 19:04:20,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:20,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:20,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491206146] [2019-12-18 19:04:20,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:20,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:20,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:20,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:20,435 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-18 19:04:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:20,693 INFO L93 Difference]: Finished difference Result 14268 states and 44852 transitions. [2019-12-18 19:04:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:20,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:04:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:20,750 INFO L225 Difference]: With dead ends: 14268 [2019-12-18 19:04:20,750 INFO L226 Difference]: Without dead ends: 14268 [2019-12-18 19:04:20,751 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 19:04:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2019-12-18 19:04:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 12752. [2019-12-18 19:04:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-12-18 19:04:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 40448 transitions. [2019-12-18 19:04:21,202 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 40448 transitions. Word has length 11 [2019-12-18 19:04:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:21,202 INFO L462 AbstractCegarLoop]: Abstraction has 12752 states and 40448 transitions. [2019-12-18 19:04:21,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 40448 transitions. [2019-12-18 19:04:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:04:21,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:21,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:21,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:21,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:21,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1372508181, now seen corresponding path program 1 times [2019-12-18 19:04:21,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:21,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654530761] [2019-12-18 19:04:21,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:21,353 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 19:04:21,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654530761] [2019-12-18 19:04:21,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:21,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:21,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107012772] [2019-12-18 19:04:21,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:21,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:21,361 INFO L87 Difference]: Start difference. First operand 12752 states and 40448 transitions. Second operand 5 states. [2019-12-18 19:04:21,508 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-18 19:04:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:21,902 INFO L93 Difference]: Finished difference Result 17010 states and 52843 transitions. [2019-12-18 19:04:21,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:04:21,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:04:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:21,958 INFO L225 Difference]: With dead ends: 17010 [2019-12-18 19:04:21,958 INFO L226 Difference]: Without dead ends: 17003 [2019-12-18 19:04:21,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17003 states. [2019-12-18 19:04:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17003 to 12755. [2019-12-18 19:04:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12755 states. [2019-12-18 19:04:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 40342 transitions. [2019-12-18 19:04:22,485 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 40342 transitions. Word has length 17 [2019-12-18 19:04:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:22,486 INFO L462 AbstractCegarLoop]: Abstraction has 12755 states and 40342 transitions. [2019-12-18 19:04:22,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 40342 transitions. [2019-12-18 19:04:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:04:22,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:22,500 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] [2019-12-18 19:04:22,500 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1155459573, now seen corresponding path program 1 times [2019-12-18 19:04:22,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:22,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172725374] [2019-12-18 19:04:22,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:22,541 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 19:04:22,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172725374] [2019-12-18 19:04:22,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:22,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:22,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163727468] [2019-12-18 19:04:22,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:22,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:22,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:22,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:22,543 INFO L87 Difference]: Start difference. First operand 12755 states and 40342 transitions. Second operand 3 states. [2019-12-18 19:04:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:22,658 INFO L93 Difference]: Finished difference Result 15529 states and 48523 transitions. [2019-12-18 19:04:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:22,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 19:04:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:22,693 INFO L225 Difference]: With dead ends: 15529 [2019-12-18 19:04:22,693 INFO L226 Difference]: Without dead ends: 15529 [2019-12-18 19:04:22,694 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 19:04:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-18 19:04:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 13746. [2019-12-18 19:04:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13746 states. [2019-12-18 19:04:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13746 states to 13746 states and 43375 transitions. [2019-12-18 19:04:23,096 INFO L78 Accepts]: Start accepts. Automaton has 13746 states and 43375 transitions. Word has length 25 [2019-12-18 19:04:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:23,098 INFO L462 AbstractCegarLoop]: Abstraction has 13746 states and 43375 transitions. [2019-12-18 19:04:23,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 13746 states and 43375 transitions. [2019-12-18 19:04:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:04:23,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:23,115 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] [2019-12-18 19:04:23,116 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1248228747, now seen corresponding path program 1 times [2019-12-18 19:04:23,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:23,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682116568] [2019-12-18 19:04:23,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:23,263 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 19:04:23,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682116568] [2019-12-18 19:04:23,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:23,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:23,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865304532] [2019-12-18 19:04:23,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:23,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:23,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:23,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:23,266 INFO L87 Difference]: Start difference. First operand 13746 states and 43375 transitions. Second operand 6 states. [2019-12-18 19:04:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:23,902 INFO L93 Difference]: Finished difference Result 19657 states and 60760 transitions. [2019-12-18 19:04:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:04:23,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 19:04:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:23,935 INFO L225 Difference]: With dead ends: 19657 [2019-12-18 19:04:23,935 INFO L226 Difference]: Without dead ends: 19641 [2019-12-18 19:04:23,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19641 states. [2019-12-18 19:04:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19641 to 15905. [2019-12-18 19:04:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15905 states. [2019-12-18 19:04:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15905 states to 15905 states and 49859 transitions. [2019-12-18 19:04:24,303 INFO L78 Accepts]: Start accepts. Automaton has 15905 states and 49859 transitions. Word has length 25 [2019-12-18 19:04:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:24,304 INFO L462 AbstractCegarLoop]: Abstraction has 15905 states and 49859 transitions. [2019-12-18 19:04:24,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15905 states and 49859 transitions. [2019-12-18 19:04:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:04:24,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:24,329 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] [2019-12-18 19:04:24,329 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash 279625016, now seen corresponding path program 1 times [2019-12-18 19:04:24,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:24,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626765215] [2019-12-18 19:04:24,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:24,398 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 19:04:24,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626765215] [2019-12-18 19:04:24,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:24,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:24,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641057012] [2019-12-18 19:04:24,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:24,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:24,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:24,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:24,400 INFO L87 Difference]: Start difference. First operand 15905 states and 49859 transitions. Second operand 4 states. [2019-12-18 19:04:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:24,433 INFO L93 Difference]: Finished difference Result 2247 states and 5122 transitions. [2019-12-18 19:04:24,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:04:24,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-18 19:04:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:24,436 INFO L225 Difference]: With dead ends: 2247 [2019-12-18 19:04:24,436 INFO L226 Difference]: Without dead ends: 1970 [2019-12-18 19:04:24,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-18 19:04:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2019-12-18 19:04:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-18 19:04:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4356 transitions. [2019-12-18 19:04:24,462 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4356 transitions. Word has length 31 [2019-12-18 19:04:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:24,463 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4356 transitions. [2019-12-18 19:04:24,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4356 transitions. [2019-12-18 19:04:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 19:04:24,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:24,466 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] [2019-12-18 19:04:24,466 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:24,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:24,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-18 19:04:24,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:24,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721702761] [2019-12-18 19:04:24,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:25,225 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 19:04:25,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721702761] [2019-12-18 19:04:25,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:25,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:04:25,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533490300] [2019-12-18 19:04:25,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:04:25,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:25,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:04:25,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:25,227 INFO L87 Difference]: Start difference. First operand 1970 states and 4356 transitions. Second operand 9 states. [2019-12-18 19:04:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:25,858 INFO L93 Difference]: Finished difference Result 2561 states and 5544 transitions. [2019-12-18 19:04:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:04:25,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 19:04:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:25,863 INFO L225 Difference]: With dead ends: 2561 [2019-12-18 19:04:25,864 INFO L226 Difference]: Without dead ends: 2559 [2019-12-18 19:04:25,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:04:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2019-12-18 19:04:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2033. [2019-12-18 19:04:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-12-18 19:04:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4500 transitions. [2019-12-18 19:04:25,896 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4500 transitions. Word has length 37 [2019-12-18 19:04:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:25,897 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4500 transitions. [2019-12-18 19:04:25,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:04:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4500 transitions. [2019-12-18 19:04:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 19:04:25,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:25,905 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] [2019-12-18 19:04:25,906 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash -669150451, now seen corresponding path program 1 times [2019-12-18 19:04:25,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:25,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333046612] [2019-12-18 19:04:25,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:26,075 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 19:04:26,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333046612] [2019-12-18 19:04:26,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:26,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:26,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796627291] [2019-12-18 19:04:26,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:26,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:26,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:26,078 INFO L87 Difference]: Start difference. First operand 2033 states and 4500 transitions. Second operand 5 states. [2019-12-18 19:04:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:26,516 INFO L93 Difference]: Finished difference Result 2780 states and 6027 transitions. [2019-12-18 19:04:26,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:26,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 19:04:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:26,522 INFO L225 Difference]: With dead ends: 2780 [2019-12-18 19:04:26,522 INFO L226 Difference]: Without dead ends: 2780 [2019-12-18 19:04:26,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:26,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-12-18 19:04:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2441. [2019-12-18 19:04:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-18 19:04:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 5347 transitions. [2019-12-18 19:04:26,563 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 5347 transitions. Word has length 41 [2019-12-18 19:04:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:26,564 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 5347 transitions. [2019-12-18 19:04:26,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 5347 transitions. [2019-12-18 19:04:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 19:04:26,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:26,569 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] [2019-12-18 19:04:26,569 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1265386816, now seen corresponding path program 1 times [2019-12-18 19:04:26,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:26,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370857771] [2019-12-18 19:04:26,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:26,642 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 19:04:26,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370857771] [2019-12-18 19:04:26,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:26,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:26,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432823510] [2019-12-18 19:04:26,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:26,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:26,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:26,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:26,645 INFO L87 Difference]: Start difference. First operand 2441 states and 5347 transitions. Second operand 3 states. [2019-12-18 19:04:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:26,669 INFO L93 Difference]: Finished difference Result 2372 states and 5134 transitions. [2019-12-18 19:04:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:26,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 19:04:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:26,672 INFO L225 Difference]: With dead ends: 2372 [2019-12-18 19:04:26,673 INFO L226 Difference]: Without dead ends: 2372 [2019-12-18 19:04:26,673 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 19:04:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-12-18 19:04:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2364. [2019-12-18 19:04:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-12-18 19:04:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 5118 transitions. [2019-12-18 19:04:26,709 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 5118 transitions. Word has length 42 [2019-12-18 19:04:26,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:26,709 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 5118 transitions. [2019-12-18 19:04:26,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 5118 transitions. [2019-12-18 19:04:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 19:04:26,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:26,714 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] [2019-12-18 19:04:26,714 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:26,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1349071825, now seen corresponding path program 1 times [2019-12-18 19:04:26,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:26,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034532664] [2019-12-18 19:04:26,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:26,810 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 19:04:26,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034532664] [2019-12-18 19:04:26,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:26,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:26,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889395719] [2019-12-18 19:04:26,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:26,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:26,813 INFO L87 Difference]: Start difference. First operand 2364 states and 5118 transitions. Second operand 6 states. [2019-12-18 19:04:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:26,949 INFO L93 Difference]: Finished difference Result 4111 states and 8951 transitions. [2019-12-18 19:04:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:04:26,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 19:04:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:26,952 INFO L225 Difference]: With dead ends: 4111 [2019-12-18 19:04:26,952 INFO L226 Difference]: Without dead ends: 2004 [2019-12-18 19:04:26,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:04:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-12-18 19:04:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1858. [2019-12-18 19:04:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2019-12-18 19:04:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3980 transitions. [2019-12-18 19:04:26,972 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3980 transitions. Word has length 42 [2019-12-18 19:04:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:26,973 INFO L462 AbstractCegarLoop]: Abstraction has 1858 states and 3980 transitions. [2019-12-18 19:04:26,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3980 transitions. [2019-12-18 19:04:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 19:04:26,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:26,976 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] [2019-12-18 19:04:26,976 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1852418777, now seen corresponding path program 1 times [2019-12-18 19:04:26,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:26,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36721090] [2019-12-18 19:04:26,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:27,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36721090] [2019-12-18 19:04:27,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:27,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:04:27,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858886471] [2019-12-18 19:04:27,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:04:27,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:27,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:04:27,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:04:27,520 INFO L87 Difference]: Start difference. First operand 1858 states and 3980 transitions. Second operand 16 states. [2019-12-18 19:04:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:28,770 INFO L93 Difference]: Finished difference Result 2644 states and 5622 transitions. [2019-12-18 19:04:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:04:28,770 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-12-18 19:04:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:28,773 INFO L225 Difference]: With dead ends: 2644 [2019-12-18 19:04:28,773 INFO L226 Difference]: Without dead ends: 2108 [2019-12-18 19:04:28,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:04:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2019-12-18 19:04:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1879. [2019-12-18 19:04:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-12-18 19:04:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4000 transitions. [2019-12-18 19:04:28,798 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4000 transitions. Word has length 43 [2019-12-18 19:04:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:28,799 INFO L462 AbstractCegarLoop]: Abstraction has 1879 states and 4000 transitions. [2019-12-18 19:04:28,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:04:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4000 transitions. [2019-12-18 19:04:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 19:04:28,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:28,803 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] [2019-12-18 19:04:28,803 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:28,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:28,803 INFO L82 PathProgramCache]: Analyzing trace with hash 588171772, now seen corresponding path program 1 times [2019-12-18 19:04:28,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:28,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548824943] [2019-12-18 19:04:28,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:28,853 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 19:04:28,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548824943] [2019-12-18 19:04:28,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:28,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:28,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545180534] [2019-12-18 19:04:28,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:28,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:28,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:28,856 INFO L87 Difference]: Start difference. First operand 1879 states and 4000 transitions. Second operand 3 states. [2019-12-18 19:04:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:28,906 INFO L93 Difference]: Finished difference Result 1852 states and 3919 transitions. [2019-12-18 19:04:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:28,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-18 19:04:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:28,909 INFO L225 Difference]: With dead ends: 1852 [2019-12-18 19:04:28,909 INFO L226 Difference]: Without dead ends: 1852 [2019-12-18 19:04:28,909 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 19:04:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2019-12-18 19:04:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1744. [2019-12-18 19:04:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2019-12-18 19:04:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 3707 transitions. [2019-12-18 19:04:28,930 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 3707 transitions. Word has length 43 [2019-12-18 19:04:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:28,930 INFO L462 AbstractCegarLoop]: Abstraction has 1744 states and 3707 transitions. [2019-12-18 19:04:28,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3707 transitions. [2019-12-18 19:04:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 19:04:28,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:28,933 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] [2019-12-18 19:04:28,933 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1100018745, now seen corresponding path program 1 times [2019-12-18 19:04:28,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:28,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744441505] [2019-12-18 19:04:28,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:29,015 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 19:04:29,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744441505] [2019-12-18 19:04:29,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:29,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:29,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723340828] [2019-12-18 19:04:29,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:29,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:29,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:29,017 INFO L87 Difference]: Start difference. First operand 1744 states and 3707 transitions. Second operand 5 states. [2019-12-18 19:04:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:29,051 INFO L93 Difference]: Finished difference Result 332 states and 580 transitions. [2019-12-18 19:04:29,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:29,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 19:04:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:29,052 INFO L225 Difference]: With dead ends: 332 [2019-12-18 19:04:29,052 INFO L226 Difference]: Without dead ends: 264 [2019-12-18 19:04:29,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:04:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-18 19:04:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 219. [2019-12-18 19:04:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-18 19:04:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-18 19:04:29,058 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 43 [2019-12-18 19:04:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:29,059 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-18 19:04:29,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-18 19:04:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:29,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:29,061 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 19:04:29,061 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:29,062 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 1 times [2019-12-18 19:04:29,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:29,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910275226] [2019-12-18 19:04:29,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:29,374 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 19:04:29,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910275226] [2019-12-18 19:04:29,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:29,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:04:29,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138725204] [2019-12-18 19:04:29,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:04:29,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:04:29,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:04:29,376 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 14 states. [2019-12-18 19:04:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:29,921 INFO L93 Difference]: Finished difference Result 384 states and 661 transitions. [2019-12-18 19:04:29,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:04:29,922 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 19:04:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:29,923 INFO L225 Difference]: With dead ends: 384 [2019-12-18 19:04:29,923 INFO L226 Difference]: Without dead ends: 353 [2019-12-18 19:04:29,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:04:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-12-18 19:04:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 319. [2019-12-18 19:04:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-18 19:04:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-18 19:04:29,931 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-18 19:04:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:29,932 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-18 19:04:29,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:04:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-18 19:04:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:29,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:29,933 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 19:04:29,933 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 2 times [2019-12-18 19:04:29,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:29,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39800243] [2019-12-18 19:04:29,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:30,277 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 19:04:30,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39800243] [2019-12-18 19:04:30,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:30,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:04:30,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507137711] [2019-12-18 19:04:30,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:04:30,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:30,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:04:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:04:30,283 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 13 states. [2019-12-18 19:04:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:30,724 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-12-18 19:04:30,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:04:30,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 19:04:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:30,726 INFO L225 Difference]: With dead ends: 420 [2019-12-18 19:04:30,726 INFO L226 Difference]: Without dead ends: 389 [2019-12-18 19:04:30,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:04:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-18 19:04:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2019-12-18 19:04:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 19:04:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-18 19:04:30,731 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-18 19:04:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:30,731 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-18 19:04:30,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:04:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-18 19:04:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:30,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:30,732 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 19:04:30,732 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 3 times [2019-12-18 19:04:30,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:30,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924724542] [2019-12-18 19:04:30,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:30,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:04:30,866 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:04:30,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2477~0.base_19|) 0) (= v_~y$r_buff1_thd0~0_304 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2477~0.base_19|) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2477~0.base_19| 1) |v_#valid_38|) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd1~0_220 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2477~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2477~0.base_19|) |v_ULTIMATE.start_main_~#t2477~0.offset_16| 0)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2477~0.base_19| 4)) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= 0 |v_ULTIMATE.start_main_~#t2477~0.offset_16|) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_~#t2477~0.base=|v_ULTIMATE.start_main_~#t2477~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t2478~0.base=|v_ULTIMATE.start_main_~#t2478~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_~#t2478~0.offset=|v_ULTIMATE.start_main_~#t2478~0.offset_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_~#t2477~0.offset=|v_ULTIMATE.start_main_~#t2477~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_~#t2477~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_~#t2478~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2478~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t2477~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:04:30,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2478~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2478~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2478~0.base_11|) |v_ULTIMATE.start_main_~#t2478~0.offset_10| 1))) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2478~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2478~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2478~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2478~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2478~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2478~0.offset=|v_ULTIMATE.start_main_~#t2478~0.offset_10|, ULTIMATE.start_main_~#t2478~0.base=|v_ULTIMATE.start_main_~#t2478~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2478~0.offset, ULTIMATE.start_main_~#t2478~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 19:04:30,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:04:30,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1512731902 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1512731902 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1512731902| ~y$w_buff0_used~0_In-1512731902)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1512731902| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1512731902, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1512731902} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1512731902|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1512731902, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1512731902} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 19:04:30,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In642110563 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In642110563 256) 0))) (or (and (= ~y~0_In642110563 |P1Thread1of1ForFork1_#t~ite9_Out642110563|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In642110563 |P1Thread1of1ForFork1_#t~ite9_Out642110563|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In642110563, ~y$w_buff1~0=~y$w_buff1~0_In642110563, ~y~0=~y~0_In642110563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642110563} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In642110563, ~y$w_buff1~0=~y$w_buff1~0_In642110563, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out642110563|, ~y~0=~y~0_In642110563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642110563} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 19:04:30,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 19:04:30,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In642230235 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In642230235 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out642230235| ~y$w_buff0_used~0_In642230235)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out642230235| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In642230235, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In642230235} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In642230235, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In642230235, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out642230235|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 19:04:30,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-535263072 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-535263072 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-535263072 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-535263072 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-535263072| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-535263072| ~y$w_buff1_used~0_In-535263072)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-535263072, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-535263072, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-535263072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-535263072} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-535263072|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-535263072, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-535263072, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-535263072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-535263072} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 19:04:30,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1926087897 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1926087897 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1926087897)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1926087897 ~y$r_buff0_thd1~0_Out1926087897)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1926087897, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1926087897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1926087897, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1926087897|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1926087897} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 19:04:30,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In131638617 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In131638617 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In131638617 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In131638617 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out131638617|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In131638617 |P1Thread1of1ForFork1_#t~ite12_Out131638617|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In131638617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131638617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131638617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131638617} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In131638617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131638617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131638617, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out131638617|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131638617} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 19:04:30,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1984257085 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1984257085 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1984257085|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-1984257085 |P1Thread1of1ForFork1_#t~ite13_Out-1984257085|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1984257085, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1984257085} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1984257085, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1984257085, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1984257085|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 19:04:30,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-4095517 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-4095517 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-4095517 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-4095517 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-4095517| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out-4095517| ~y$r_buff1_thd2~0_In-4095517)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-4095517, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-4095517, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-4095517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-4095517} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-4095517, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-4095517, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-4095517, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-4095517|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-4095517} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 19:04:30,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 19:04:30,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1827638147 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1827638147 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1827638147 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1827638147 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1827638147| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1827638147| ~y$r_buff1_thd1~0_In1827638147)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1827638147, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1827638147, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1827638147, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1827638147} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1827638147, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1827638147, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1827638147|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1827638147, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1827638147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 19:04:30,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 19:04:30,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:04:30,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In393633429 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In393633429 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out393633429| ~y$w_buff1~0_In393633429) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In393633429 |ULTIMATE.start_main_#t~ite17_Out393633429|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In393633429, ~y~0=~y~0_In393633429, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In393633429, ~y$w_buff1_used~0=~y$w_buff1_used~0_In393633429} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out393633429|, ~y$w_buff1~0=~y$w_buff1~0_In393633429, ~y~0=~y~0_In393633429, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In393633429, ~y$w_buff1_used~0=~y$w_buff1_used~0_In393633429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 19:04:30,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 19:04:30,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1943987922 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1943987922 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1943987922| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1943987922 |ULTIMATE.start_main_#t~ite19_Out1943987922|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1943987922, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1943987922} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1943987922, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1943987922|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1943987922} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 19:04:30,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1814216036 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1814216036 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1814216036 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1814216036 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1814216036|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1814216036 |ULTIMATE.start_main_#t~ite20_Out-1814216036|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814216036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1814216036, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1814216036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1814216036} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814216036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1814216036, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1814216036|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1814216036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1814216036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 19:04:30,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-871560536 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-871560536 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-871560536|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-871560536| ~y$r_buff0_thd0~0_In-871560536)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-871560536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-871560536} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-871560536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-871560536, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-871560536|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 19:04:30,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In682031452 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In682031452 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In682031452 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In682031452 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out682031452|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out682031452| ~y$r_buff1_thd0~0_In682031452) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In682031452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In682031452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In682031452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In682031452} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In682031452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In682031452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In682031452, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out682031452|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In682031452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 19:04:30,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-737366931 256)))) (or (and (= ~y$w_buff0_used~0_In-737366931 |ULTIMATE.start_main_#t~ite35_Out-737366931|) (= |ULTIMATE.start_main_#t~ite34_In-737366931| |ULTIMATE.start_main_#t~ite34_Out-737366931|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-737366931 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-737366931 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-737366931 256) 0)) (= (mod ~y$w_buff0_used~0_In-737366931 256) 0))) (= ~y$w_buff0_used~0_In-737366931 |ULTIMATE.start_main_#t~ite34_Out-737366931|) (= |ULTIMATE.start_main_#t~ite34_Out-737366931| |ULTIMATE.start_main_#t~ite35_Out-737366931|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-737366931, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-737366931, ~weak$$choice2~0=~weak$$choice2~0_In-737366931, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-737366931, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-737366931, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In-737366931|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-737366931, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-737366931, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-737366931|, ~weak$$choice2~0=~weak$$choice2~0_In-737366931, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-737366931, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-737366931|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-737366931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 19:04:30,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 19:04:30,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:04:30,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 19:04:31,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:04:31 BasicIcfg [2019-12-18 19:04:31,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:04:31,007 INFO L168 Benchmark]: Toolchain (without parser) took 20728.31 ms. Allocated memory was 145.2 MB in the beginning and 842.5 MB in the end (delta: 697.3 MB). Free memory was 101.3 MB in the beginning and 649.2 MB in the end (delta: -547.9 MB). Peak memory consumption was 149.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:31,008 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 19:04:31,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.20 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 157.5 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:31,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.55 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:31,010 INFO L168 Benchmark]: Boogie Preprocessor took 34.87 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:31,011 INFO L168 Benchmark]: RCFGBuilder took 822.48 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:31,011 INFO L168 Benchmark]: TraceAbstraction took 19036.82 ms. Allocated memory was 202.9 MB in the beginning and 842.5 MB in the end (delta: 639.6 MB). Free memory was 107.5 MB in the beginning and 649.2 MB in the end (delta: -541.7 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:31,015 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.44 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.20 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 157.5 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.55 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.87 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.48 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19036.82 ms. Allocated memory was 202.9 MB in the beginning and 842.5 MB in the end (delta: 639.6 MB). Free memory was 107.5 MB in the beginning and 649.2 MB in the end (delta: -541.7 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2107 SDtfs, 2184 SDslu, 5731 SDs, 0 SdLazy, 3477 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 16 SyntacticMatches, 13 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15905occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 14084 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 114242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...