/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:46:01,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:46:01,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:46:01,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:46:01,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:46:01,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:46:01,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:46:01,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:46:01,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:46:01,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:46:01,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:46:01,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:46:01,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:46:01,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:46:01,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:46:01,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:46:01,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:46:01,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:46:01,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:46:01,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:46:01,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:46:01,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:46:01,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:46:01,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:46:01,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:46:01,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:46:01,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:46:01,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:46:01,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:46:01,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:46:01,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:46:01,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:46:01,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:46:01,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:46:01,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:46:01,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:46:01,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:46:01,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:46:01,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:46:01,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:46:01,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:46:01,167 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-MCR.epf [2019-12-27 18:46:01,189 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:46:01,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:46:01,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:46:01,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:46:01,192 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:46:01,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:46:01,192 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:46:01,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:46:01,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:46:01,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:46:01,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:46:01,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:46:01,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:46:01,195 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:46:01,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:46:01,195 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:46:01,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:46:01,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:46:01,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:46:01,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:46:01,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:46:01,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:46:01,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:46:01,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:46:01,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:46:01,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:46:01,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:46:01,197 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:46:01,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:46:01,198 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:46:01,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:46:01,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:46:01,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:46:01,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:46:01,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:46:01,520 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:46:01,521 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-27 18:46:01,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79874497f/69edcdecc75248a5a695b376a3da164e/FLAG85c3e35d5 [2019-12-27 18:46:02,162 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:46:02,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-27 18:46:02,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79874497f/69edcdecc75248a5a695b376a3da164e/FLAG85c3e35d5 [2019-12-27 18:46:02,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79874497f/69edcdecc75248a5a695b376a3da164e [2019-12-27 18:46:02,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:46:02,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:46:02,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:02,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:46:02,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:46:02,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:02" (1/1) ... [2019-12-27 18:46:02,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71403420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:02, skipping insertion in model container [2019-12-27 18:46:02,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:02" (1/1) ... [2019-12-27 18:46:02,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:46:02,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:46:02,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:03,013 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:46:03,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:03,158 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:46:03,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03 WrapperNode [2019-12-27 18:46:03,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:03,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:03,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:46:03,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:46:03,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:03,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:46:03,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:46:03,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:46:03,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... [2019-12-27 18:46:03,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:46:03,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:46:03,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:46:03,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:46:03,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:46:03,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:46:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:46:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:46:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:46:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:46:03,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:46:03,336 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:46:03,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:46:03,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:46:03,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:46:03,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:46:03,338 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:46:04,016 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:46:04,016 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:46:04,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:04 BoogieIcfgContainer [2019-12-27 18:46:04,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:46:04,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:46:04,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:46:04,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:46:04,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:46:02" (1/3) ... [2019-12-27 18:46:04,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85eb78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:04, skipping insertion in model container [2019-12-27 18:46:04,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:03" (2/3) ... [2019-12-27 18:46:04,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85eb78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:04, skipping insertion in model container [2019-12-27 18:46:04,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:04" (3/3) ... [2019-12-27 18:46:04,026 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2019-12-27 18:46:04,036 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:46:04,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:46:04,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:46:04,044 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:46:04,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,083 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,084 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,093 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,093 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,114 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:04,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:46:04,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:46:04,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:46:04,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:46:04,152 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:46:04,153 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:46:04,153 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:46:04,153 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:46:04,153 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:46:04,170 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 18:46:04,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 18:46:04,279 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 18:46:04,280 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:04,292 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. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:46:04,308 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 18:46:04,349 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 18:46:04,349 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:04,355 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. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:46:04,368 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 18:46:04,369 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:46:08,733 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 18:46:08,863 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-27 18:46:08,863 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 18:46:08,867 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 18:46:09,334 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-27 18:46:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-27 18:46:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:46:09,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:09,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:46:09,345 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:09,351 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-27 18:46:09,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:09,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557399772] [2019-12-27 18:46:09,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:09,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557399772] [2019-12-27 18:46:09,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:09,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:46:09,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811827251] [2019-12-27 18:46:09,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:09,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:09,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:46:09,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:09,593 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:09,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:09,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:09,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:09,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:09,614 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-27 18:46:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:09,879 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-27 18:46:09,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:09,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:46:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:10,016 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 18:46:10,016 INFO L226 Difference]: Without dead ends: 8226 [2019-12-27 18:46:10,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-27 18:46:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-27 18:46:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-27 18:46:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-27 18:46:10,546 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-27 18:46:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:10,547 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-27 18:46:10,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-27 18:46:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:46:10,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:10,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:10,550 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:10,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-27 18:46:10,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:10,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378752951] [2019-12-27 18:46:10,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:10,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378752951] [2019-12-27 18:46:10,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:10,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:10,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1109835394] [2019-12-27 18:46:10,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:10,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:10,722 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:46:10,722 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:10,723 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:10,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:10,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:10,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:10,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:10,726 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-27 18:46:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:11,144 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-27 18:46:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:11,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:46:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:11,220 INFO L225 Difference]: With dead ends: 12778 [2019-12-27 18:46:11,221 INFO L226 Difference]: Without dead ends: 12771 [2019-12-27 18:46:11,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-27 18:46:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-27 18:46:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-27 18:46:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-27 18:46:12,232 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-27 18:46:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:12,232 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-27 18:46:12,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-27 18:46:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:46:12,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:12,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:12,242 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-27 18:46:12,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:12,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120994137] [2019-12-27 18:46:12,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:12,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120994137] [2019-12-27 18:46:12,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:12,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:12,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453722825] [2019-12-27 18:46:12,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:12,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:12,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:46:12,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:12,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:12,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:12,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:12,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:12,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:12,394 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-27 18:46:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:12,447 INFO L93 Difference]: Finished difference Result 1910 states and 4431 transitions. [2019-12-27 18:46:12,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:46:12,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:46:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:12,453 INFO L225 Difference]: With dead ends: 1910 [2019-12-27 18:46:12,453 INFO L226 Difference]: Without dead ends: 1633 [2019-12-27 18:46:12,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-12-27 18:46:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2019-12-27 18:46:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-12-27 18:46:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 3665 transitions. [2019-12-27 18:46:12,498 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 3665 transitions. Word has length 11 [2019-12-27 18:46:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:12,498 INFO L462 AbstractCegarLoop]: Abstraction has 1633 states and 3665 transitions. [2019-12-27 18:46:12,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 3665 transitions. [2019-12-27 18:46:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:46:12,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:12,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] [2019-12-27 18:46:12,501 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:12,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1924498971, now seen corresponding path program 1 times [2019-12-27 18:46:12,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:12,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093162676] [2019-12-27 18:46:12,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:12,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093162676] [2019-12-27 18:46:12,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:12,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:46:12,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1313066805] [2019-12-27 18:46:12,729 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:12,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:12,739 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:46:12,739 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:12,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:12,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:46:12,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:12,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:46:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:12,741 INFO L87 Difference]: Start difference. First operand 1633 states and 3665 transitions. Second operand 7 states. [2019-12-27 18:46:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:13,193 INFO L93 Difference]: Finished difference Result 2064 states and 4529 transitions. [2019-12-27 18:46:13,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:46:13,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:46:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:13,199 INFO L225 Difference]: With dead ends: 2064 [2019-12-27 18:46:13,199 INFO L226 Difference]: Without dead ends: 2064 [2019-12-27 18:46:13,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:46:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-27 18:46:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1847. [2019-12-27 18:46:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-12-27 18:46:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 4101 transitions. [2019-12-27 18:46:13,252 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 4101 transitions. Word has length 23 [2019-12-27 18:46:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:13,252 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 4101 transitions. [2019-12-27 18:46:13,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:46:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 4101 transitions. [2019-12-27 18:46:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:46:13,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:13,256 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-27 18:46:13,257 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash -918854658, now seen corresponding path program 1 times [2019-12-27 18:46:13,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:13,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894965915] [2019-12-27 18:46:13,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:13,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894965915] [2019-12-27 18:46:13,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:13,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:13,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1049337497] [2019-12-27 18:46:13,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:13,348 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:13,360 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 18:46:13,360 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:13,361 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:13,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:13,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:13,362 INFO L87 Difference]: Start difference. First operand 1847 states and 4101 transitions. Second operand 3 states. [2019-12-27 18:46:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:13,507 INFO L93 Difference]: Finished difference Result 2173 states and 4758 transitions. [2019-12-27 18:46:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:13,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-27 18:46:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:13,513 INFO L225 Difference]: With dead ends: 2173 [2019-12-27 18:46:13,513 INFO L226 Difference]: Without dead ends: 2173 [2019-12-27 18:46:13,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-12-27 18:46:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1970. [2019-12-27 18:46:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-27 18:46:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4356 transitions. [2019-12-27 18:46:13,555 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4356 transitions. Word has length 37 [2019-12-27 18:46:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:13,557 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4356 transitions. [2019-12-27 18:46:13,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4356 transitions. [2019-12-27 18:46:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:46:13,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:13,562 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-27 18:46:13,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:13,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-27 18:46:13,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:13,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144310356] [2019-12-27 18:46:13,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:13,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144310356] [2019-12-27 18:46:13,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:13,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:13,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915472643] [2019-12-27 18:46:13,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:13,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:13,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 18:46:13,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:13,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:13,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:13,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:13,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:13,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:13,742 INFO L87 Difference]: Start difference. First operand 1970 states and 4356 transitions. Second operand 5 states. [2019-12-27 18:46:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:13,787 INFO L93 Difference]: Finished difference Result 415 states and 757 transitions. [2019-12-27 18:46:13,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:13,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:46:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:13,788 INFO L225 Difference]: With dead ends: 415 [2019-12-27 18:46:13,788 INFO L226 Difference]: Without dead ends: 370 [2019-12-27 18:46:13,789 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-27 18:46:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-27 18:46:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 342. [2019-12-27 18:46:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-27 18:46:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 617 transitions. [2019-12-27 18:46:13,798 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 617 transitions. Word has length 37 [2019-12-27 18:46:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:13,799 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 617 transitions. [2019-12-27 18:46:13,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 617 transitions. [2019-12-27 18:46:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:13,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:13,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:13,804 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:13,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1093435048, now seen corresponding path program 1 times [2019-12-27 18:46:13,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:13,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271900360] [2019-12-27 18:46:13,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:13,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271900360] [2019-12-27 18:46:13,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:13,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:13,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152359911] [2019-12-27 18:46:13,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:13,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:13,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 111 transitions. [2019-12-27 18:46:13,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:13,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:46:13,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:13,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:13,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:13,977 INFO L87 Difference]: Start difference. First operand 342 states and 617 transitions. Second operand 5 states. [2019-12-27 18:46:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:14,128 INFO L93 Difference]: Finished difference Result 438 states and 765 transitions. [2019-12-27 18:46:14,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:46:14,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 18:46:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:14,131 INFO L225 Difference]: With dead ends: 438 [2019-12-27 18:46:14,131 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 18:46:14,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 18:46:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 330. [2019-12-27 18:46:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 18:46:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 581 transitions. [2019-12-27 18:46:14,139 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 581 transitions. Word has length 52 [2019-12-27 18:46:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:14,139 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 581 transitions. [2019-12-27 18:46:14,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 581 transitions. [2019-12-27 18:46:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:46:14,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:14,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:14,141 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:14,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash 456891136, now seen corresponding path program 1 times [2019-12-27 18:46:14,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:14,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071422416] [2019-12-27 18:46:14,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:14,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071422416] [2019-12-27 18:46:14,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:14,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:46:14,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933508103] [2019-12-27 18:46:14,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:14,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:14,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 73 transitions. [2019-12-27 18:46:14,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:14,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:46:14,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:14,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:14,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:14,350 INFO L87 Difference]: Start difference. First operand 330 states and 581 transitions. Second operand 5 states. [2019-12-27 18:46:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:14,562 INFO L93 Difference]: Finished difference Result 486 states and 863 transitions. [2019-12-27 18:46:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:46:14,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 18:46:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:14,564 INFO L225 Difference]: With dead ends: 486 [2019-12-27 18:46:14,564 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 18:46:14,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 18:46:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 421. [2019-12-27 18:46:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-27 18:46:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 747 transitions. [2019-12-27 18:46:14,573 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 747 transitions. Word has length 53 [2019-12-27 18:46:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:14,574 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 747 transitions. [2019-12-27 18:46:14,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 747 transitions. [2019-12-27 18:46:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:46:14,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:14,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:14,576 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:14,576 INFO L82 PathProgramCache]: Analyzing trace with hash 923557156, now seen corresponding path program 2 times [2019-12-27 18:46:14,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:14,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403536415] [2019-12-27 18:46:14,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:14,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403536415] [2019-12-27 18:46:14,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:14,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:46:14,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720305380] [2019-12-27 18:46:14,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:14,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:14,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 75 transitions. [2019-12-27 18:46:14,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:14,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:46:14,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:46:14,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:14,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:46:14,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:14,762 INFO L87 Difference]: Start difference. First operand 421 states and 747 transitions. Second operand 6 states. [2019-12-27 18:46:14,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:14,909 INFO L93 Difference]: Finished difference Result 510 states and 902 transitions. [2019-12-27 18:46:14,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:46:14,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 18:46:14,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:14,911 INFO L225 Difference]: With dead ends: 510 [2019-12-27 18:46:14,911 INFO L226 Difference]: Without dead ends: 510 [2019-12-27 18:46:14,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-12-27 18:46:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 428. [2019-12-27 18:46:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-12-27 18:46:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 760 transitions. [2019-12-27 18:46:14,920 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 760 transitions. Word has length 53 [2019-12-27 18:46:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:14,921 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 760 transitions. [2019-12-27 18:46:14,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:46:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 760 transitions. [2019-12-27 18:46:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:46:14,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:14,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:14,923 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:14,923 INFO L82 PathProgramCache]: Analyzing trace with hash 660947046, now seen corresponding path program 3 times [2019-12-27 18:46:14,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:14,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115260117] [2019-12-27 18:46:14,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:15,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115260117] [2019-12-27 18:46:15,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:15,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:15,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1997935346] [2019-12-27 18:46:15,047 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:15,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:15,092 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 80 transitions. [2019-12-27 18:46:15,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:15,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:15,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:15,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:15,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:15,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:15,095 INFO L87 Difference]: Start difference. First operand 428 states and 760 transitions. Second operand 3 states. [2019-12-27 18:46:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:15,133 INFO L93 Difference]: Finished difference Result 427 states and 758 transitions. [2019-12-27 18:46:15,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:15,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:46:15,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:15,135 INFO L225 Difference]: With dead ends: 427 [2019-12-27 18:46:15,135 INFO L226 Difference]: Without dead ends: 427 [2019-12-27 18:46:15,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-12-27 18:46:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2019-12-27 18:46:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 18:46:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 579 transitions. [2019-12-27 18:46:15,143 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 579 transitions. Word has length 53 [2019-12-27 18:46:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:15,144 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 579 transitions. [2019-12-27 18:46:15,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2019-12-27 18:46:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:15,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:15,145 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-27 18:46:15,146 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1896622654, now seen corresponding path program 1 times [2019-12-27 18:46:15,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:15,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469954255] [2019-12-27 18:46:15,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:15,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469954255] [2019-12-27 18:46:15,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:15,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:46:15,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894177957] [2019-12-27 18:46:15,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:15,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:15,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 74 transitions. [2019-12-27 18:46:15,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:15,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:46:15,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:46:15,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:15,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:46:15,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:15,406 INFO L87 Difference]: Start difference. First operand 329 states and 579 transitions. Second operand 6 states. [2019-12-27 18:46:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:15,495 INFO L93 Difference]: Finished difference Result 530 states and 934 transitions. [2019-12-27 18:46:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:46:15,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 18:46:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:15,496 INFO L225 Difference]: With dead ends: 530 [2019-12-27 18:46:15,496 INFO L226 Difference]: Without dead ends: 243 [2019-12-27 18:46:15,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:46:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-27 18:46:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-12-27 18:46:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-27 18:46:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-27 18:46:15,505 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 54 [2019-12-27 18:46:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:15,505 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-27 18:46:15,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:46:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-27 18:46:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:15,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:15,506 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-27 18:46:15,506 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:15,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 2 times [2019-12-27 18:46:15,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:15,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690827879] [2019-12-27 18:46:15,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:15,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690827879] [2019-12-27 18:46:15,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:15,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:46:15,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [796920325] [2019-12-27 18:46:15,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:15,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:15,894 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 113 transitions. [2019-12-27 18:46:15,895 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:16,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:46:16,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:46:16,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:46:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:46:16,122 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 17 states. [2019-12-27 18:46:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:18,195 INFO L93 Difference]: Finished difference Result 564 states and 958 transitions. [2019-12-27 18:46:18,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 18:46:18,195 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-27 18:46:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:18,197 INFO L225 Difference]: With dead ends: 564 [2019-12-27 18:46:18,197 INFO L226 Difference]: Without dead ends: 533 [2019-12-27 18:46:18,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 18:46:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-12-27 18:46:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 319. [2019-12-27 18:46:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 18:46:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-27 18:46:18,207 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-27 18:46:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:18,207 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-27 18:46:18,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:46:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-27 18:46:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:18,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:18,208 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-27 18:46:18,208 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 3 times [2019-12-27 18:46:18,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:18,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386320328] [2019-12-27 18:46:18,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:46:18,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386320328] [2019-12-27 18:46:18,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:18,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:46:18,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441908545] [2019-12-27 18:46:18,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:18,514 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:18,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 102 transitions. [2019-12-27 18:46:18,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:18,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:46:18,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:46:18,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:46:18,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:46:18,708 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 15 states. [2019-12-27 18:46:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:19,269 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-12-27 18:46:19,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:46:19,270 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 18:46:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:19,272 INFO L225 Difference]: With dead ends: 420 [2019-12-27 18:46:19,272 INFO L226 Difference]: Without dead ends: 389 [2019-12-27 18:46:19,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:46:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-27 18:46:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2019-12-27 18:46:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 18:46:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-27 18:46:19,280 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-27 18:46:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:19,281 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-27 18:46:19,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:46:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-27 18:46:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:19,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:19,282 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-27 18:46:19,282 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:19,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:19,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 4 times [2019-12-27 18:46:19,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:19,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900085299] [2019-12-27 18:46:19,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:46:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:46:19,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:46:19,403 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:46:19,408 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-27 18:46:19,409 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-27 18:46:19,409 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-27 18:46:19,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1393201693 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1393201693 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1393201693| ~y$w_buff0_used~0_In-1393201693)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1393201693| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1393201693, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1393201693} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1393201693|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1393201693, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1393201693} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:46:19,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1073577613 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1073577613 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1073577613| ~y~0_In1073577613) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1073577613| ~y$w_buff1~0_In1073577613)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1073577613, ~y$w_buff1~0=~y$w_buff1~0_In1073577613, ~y~0=~y~0_In1073577613, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1073577613} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1073577613, ~y$w_buff1~0=~y$w_buff1~0_In1073577613, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1073577613|, ~y~0=~y~0_In1073577613, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1073577613} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:46:19,412 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-27 18:46:19,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1697746597 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1697746597 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1697746597| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1697746597 |P1Thread1of1ForFork1_#t~ite11_Out1697746597|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1697746597, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1697746597} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1697746597, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1697746597, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1697746597|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:46:19,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1602205057 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1602205057 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1602205057 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1602205057 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1602205057|)) (and (= ~y$w_buff1_used~0_In1602205057 |P0Thread1of1ForFork0_#t~ite6_Out1602205057|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1602205057, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1602205057, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1602205057, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1602205057} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1602205057|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1602205057, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1602205057, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1602205057, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1602205057} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:46:19,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-471126657 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-471126657 256)))) (or (and (= ~y$r_buff0_thd1~0_Out-471126657 ~y$r_buff0_thd1~0_In-471126657) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd1~0_Out-471126657 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-471126657, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-471126657} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-471126657, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-471126657|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-471126657} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:46:19,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In58920833 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In58920833 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In58920833 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In58920833 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out58920833|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In58920833 |P1Thread1of1ForFork1_#t~ite12_Out58920833|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In58920833, ~y$w_buff0_used~0=~y$w_buff0_used~0_In58920833, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In58920833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In58920833} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In58920833, ~y$w_buff0_used~0=~y$w_buff0_used~0_In58920833, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In58920833, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out58920833|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In58920833} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:46:19,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1835008149 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1835008149 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1835008149| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1835008149| ~y$r_buff0_thd2~0_In1835008149) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1835008149, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1835008149} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1835008149, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1835008149, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1835008149|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:46:19,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1779490658 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1779490658 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1779490658 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1779490658 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1779490658 |P1Thread1of1ForFork1_#t~ite14_Out-1779490658|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1779490658| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1779490658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1779490658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1779490658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1779490658} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1779490658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1779490658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1779490658, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1779490658|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1779490658} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:46:19,416 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-27 18:46:19,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In960831379 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In960831379 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In960831379 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In960831379 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out960831379| ~y$r_buff1_thd1~0_In960831379)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out960831379| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In960831379, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960831379, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In960831379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960831379} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In960831379, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960831379, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out960831379|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In960831379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960831379} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:46:19,417 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-27 18:46:19,418 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-27 18:46:19,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1431924461 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1431924461 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In1431924461 |ULTIMATE.start_main_#t~ite17_Out1431924461|)) (and (= |ULTIMATE.start_main_#t~ite17_Out1431924461| ~y$w_buff1~0_In1431924461) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1431924461, ~y~0=~y~0_In1431924461, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1431924461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1431924461} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1431924461|, ~y$w_buff1~0=~y$w_buff1~0_In1431924461, ~y~0=~y~0_In1431924461, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1431924461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1431924461} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 18:46:19,418 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-27 18:46:19,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-552761387 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-552761387 256)))) (or (and (= ~y$w_buff0_used~0_In-552761387 |ULTIMATE.start_main_#t~ite19_Out-552761387|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out-552761387| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-552761387, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-552761387} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-552761387, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-552761387|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-552761387} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:46:19,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-533690289 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-533690289 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-533690289 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-533690289 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out-533690289| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-533690289| ~y$w_buff1_used~0_In-533690289)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-533690289, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-533690289, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-533690289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-533690289} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-533690289, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-533690289, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-533690289|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-533690289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-533690289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:46:19,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1598752198 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1598752198 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1598752198|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-1598752198 |ULTIMATE.start_main_#t~ite21_Out-1598752198|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598752198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1598752198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598752198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1598752198, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1598752198|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:46:19,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In228141203 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In228141203 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In228141203 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In228141203 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out228141203| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out228141203| ~y$r_buff1_thd0~0_In228141203) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In228141203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In228141203, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In228141203, ~y$w_buff1_used~0=~y$w_buff1_used~0_In228141203} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In228141203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In228141203, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In228141203, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out228141203|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In228141203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:46:19,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-922921410 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-922921410 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-922921410 256))) (= (mod ~y$w_buff0_used~0_In-922921410 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-922921410 256) 0)))) (= |ULTIMATE.start_main_#t~ite34_Out-922921410| |ULTIMATE.start_main_#t~ite35_Out-922921410|) (= ~y$w_buff0_used~0_In-922921410 |ULTIMATE.start_main_#t~ite34_Out-922921410|)) (and (= |ULTIMATE.start_main_#t~ite34_In-922921410| |ULTIMATE.start_main_#t~ite34_Out-922921410|) (= ~y$w_buff0_used~0_In-922921410 |ULTIMATE.start_main_#t~ite35_Out-922921410|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-922921410, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-922921410, ~weak$$choice2~0=~weak$$choice2~0_In-922921410, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-922921410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-922921410, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In-922921410|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-922921410, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-922921410, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-922921410|, ~weak$$choice2~0=~weak$$choice2~0_In-922921410, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-922921410, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-922921410|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-922921410} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 18:46:19,427 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-27 18:46:19,428 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-27 18:46:19,428 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-27 18:46:19,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:46:19 BasicIcfg [2019-12-27 18:46:19,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:46:19,520 INFO L168 Benchmark]: Toolchain (without parser) took 17096.77 ms. Allocated memory was 138.4 MB in the beginning and 656.4 MB in the end (delta: 518.0 MB). Free memory was 101.8 MB in the beginning and 175.6 MB in the end (delta: -73.7 MB). Peak memory consumption was 444.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:19,525 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 18:46:19,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.54 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.6 MB in the beginning and 155.5 MB in the end (delta: -53.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:19,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.68 ms. Allocated memory is still 201.3 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:19,529 INFO L168 Benchmark]: Boogie Preprocessor took 35.07 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:19,538 INFO L168 Benchmark]: RCFGBuilder took 759.61 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 106.6 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:19,541 INFO L168 Benchmark]: TraceAbstraction took 15498.61 ms. Allocated memory was 201.3 MB in the beginning and 656.4 MB in the end (delta: 455.1 MB). Free memory was 105.9 MB in the beginning and 175.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 385.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:19,545 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.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.54 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.6 MB in the beginning and 155.5 MB in the end (delta: -53.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.68 ms. Allocated memory is still 201.3 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.07 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 759.61 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 106.6 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15498.61 ms. Allocated memory was 201.3 MB in the beginning and 656.4 MB in the end (delta: 455.1 MB). Free memory was 105.9 MB in the beginning and 175.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 385.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 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.5s, 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: 15.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1347 SDtfs, 1478 SDslu, 3211 SDs, 0 SdLazy, 2036 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 26 SyntacticMatches, 19 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11467occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 2405 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 94293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...