/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/mix032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:45:46,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:45:46,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:45:46,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:45:46,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:45:46,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:45:46,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:45:46,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:45:46,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:45:46,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:45:46,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:45:46,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:45:46,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:45:46,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:45:46,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:45:46,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:45:46,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:45:46,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:45:46,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:45:46,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:45:46,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:45:46,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:45:46,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:45:46,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:45:46,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:45:46,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:45:46,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:45:46,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:45:46,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:45:46,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:45:46,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:45:46,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:45:46,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:45:46,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:45:46,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:45:46,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:45:46,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:45:46,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:45:46,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:45:46,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:45:46,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:45:46,307 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 16:45:46,322 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:45:46,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:45:46,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:45:46,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:45:46,324 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:45:46,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:45:46,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:45:46,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:45:46,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:45:46,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:45:46,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:45:46,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:45:46,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:45:46,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:45:46,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:45:46,326 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:45:46,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:45:46,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:45:46,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:45:46,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:45:46,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:45:46,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:45:46,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:45:46,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:45:46,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:45:46,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:45:46,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:45:46,329 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:45:46,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:45:46,329 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:45:46,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:45:46,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:45:46,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:45:46,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:45:46,633 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:45:46,633 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:45:46,634 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2019-12-27 16:45:46,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42309078b/e665a37788e54203abbd558691d728ef/FLAG953eee4db [2019-12-27 16:45:47,272 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:45:47,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2019-12-27 16:45:47,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42309078b/e665a37788e54203abbd558691d728ef/FLAG953eee4db [2019-12-27 16:45:47,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42309078b/e665a37788e54203abbd558691d728ef [2019-12-27 16:45:47,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:45:47,548 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:45:47,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:47,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:45:47,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:45:47,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:47" (1/1) ... [2019-12-27 16:45:47,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78428862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:47, skipping insertion in model container [2019-12-27 16:45:47,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:47" (1/1) ... [2019-12-27 16:45:47,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:45:47,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:45:48,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:48,181 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:45:48,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:48,356 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:45:48,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48 WrapperNode [2019-12-27 16:45:48,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:48,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:48,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:45:48,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:45:48,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:48,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:45:48,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:45:48,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:45:48,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (1/1) ... [2019-12-27 16:45:48,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:45:48,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:45:48,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:45:48,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:45:48,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (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 16:45:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:45:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:45:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:45:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:45:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:45:48,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:45:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:45:48,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:45:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:45:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:45:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:45:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:45:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:45:48,544 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 16:45:49,315 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:45:49,315 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:45:49,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:49 BoogieIcfgContainer [2019-12-27 16:45:49,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:45:49,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:45:49,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:45:49,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:45:49,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:45:47" (1/3) ... [2019-12-27 16:45:49,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1167e8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:49, skipping insertion in model container [2019-12-27 16:45:49,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:48" (2/3) ... [2019-12-27 16:45:49,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1167e8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:49, skipping insertion in model container [2019-12-27 16:45:49,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:49" (3/3) ... [2019-12-27 16:45:49,325 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_rmo.oepc.i [2019-12-27 16:45:49,336 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:45:49,337 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:45:49,345 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:45:49,346 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:45:49,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,439 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,439 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,473 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,475 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:49,501 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:45:49,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:45:49,525 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:45:49,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:45:49,525 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:45:49,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:45:49,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:45:49,525 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:45:49,526 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:45:49,544 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 16:45:49,546 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 16:45:49,651 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 16:45:49,651 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:49,668 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:45:49,700 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 16:45:49,760 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 16:45:49,760 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:49,772 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:45:49,800 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:45:49,802 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:45:55,225 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 16:45:55,361 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 16:45:55,398 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-27 16:45:55,398 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 16:45:55,402 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-27 16:46:17,580 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-27 16:46:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-27 16:46:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:46:17,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:17,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:46:17,589 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-27 16:46:17,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:17,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539780412] [2019-12-27 16:46:17,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:17,925 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 16:46:17,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539780412] [2019-12-27 16:46:17,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:17,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:46:17,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [432200657] [2019-12-27 16:46:17,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:17,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:17,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:46:17,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:17,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:17,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:17,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:17,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:17,969 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-27 16:46:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:19,571 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-27 16:46:19,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:19,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:46:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:20,278 INFO L225 Difference]: With dead ends: 128376 [2019-12-27 16:46:20,279 INFO L226 Difference]: Without dead ends: 120914 [2019-12-27 16:46:20,280 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 16:46:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-27 16:46:31,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-27 16:46:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-27 16:46:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-27 16:46:31,945 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-27 16:46:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:31,945 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-27 16:46:31,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-27 16:46:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:46:31,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:31,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:31,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-27 16:46:31,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:31,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493923605] [2019-12-27 16:46:31,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:32,051 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 16:46:32,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493923605] [2019-12-27 16:46:32,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:32,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:46:32,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565623760] [2019-12-27 16:46:32,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:32,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:32,060 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:46:32,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:32,060 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:32,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:46:32,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:32,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:46:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:46:32,063 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-27 16:46:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:38,206 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-27 16:46:38,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:46:38,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:46:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:38,841 INFO L225 Difference]: With dead ends: 187704 [2019-12-27 16:46:38,841 INFO L226 Difference]: Without dead ends: 187655 [2019-12-27 16:46:38,842 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 16:46:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-27 16:46:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-27 16:46:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-27 16:46:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-27 16:46:53,740 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-27 16:46:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:53,740 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-27 16:46:53,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:46:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-27 16:46:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:46:53,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:53,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:53,754 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-27 16:46:53,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:53,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086568442] [2019-12-27 16:46:53,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:53,806 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 16:46:53,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086568442] [2019-12-27 16:46:53,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:53,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:46:53,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [588545341] [2019-12-27 16:46:53,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:53,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:53,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:46:53,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:53,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:53,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:53,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:53,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:53,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:53,812 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-27 16:46:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:53,972 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-27 16:46:53,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:53,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:46:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:54,068 INFO L225 Difference]: With dead ends: 36261 [2019-12-27 16:46:54,069 INFO L226 Difference]: Without dead ends: 36261 [2019-12-27 16:46:54,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-27 16:46:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-27 16:46:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-27 16:46:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-27 16:46:54,813 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-27 16:46:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:54,814 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-27 16:46:54,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-27 16:46:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:46:54,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:54,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:54,817 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:54,817 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-27 16:46:54,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:54,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599841791] [2019-12-27 16:46:54,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:54,901 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 16:46:54,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599841791] [2019-12-27 16:46:54,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:54,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:46:54,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626312295] [2019-12-27 16:46:54,903 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:54,905 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:54,908 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:46:54,908 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:54,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:54,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:46:54,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:54,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:46:54,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:46:54,909 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-27 16:46:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:55,472 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-27 16:46:55,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:46:55,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:46:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:55,575 INFO L225 Difference]: With dead ends: 50300 [2019-12-27 16:46:55,576 INFO L226 Difference]: Without dead ends: 50300 [2019-12-27 16:46:55,576 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 16:46:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-27 16:46:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-27 16:46:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-27 16:46:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-27 16:46:59,289 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-27 16:46:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:59,290 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-27 16:46:59,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:46:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-27 16:46:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:46:59,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:59,301 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] [2019-12-27 16:46:59,301 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:59,302 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-27 16:46:59,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:59,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231455346] [2019-12-27 16:46:59,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:59,393 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 16:46:59,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231455346] [2019-12-27 16:46:59,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:59,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:46:59,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [233502405] [2019-12-27 16:46:59,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:59,399 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:59,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:46:59,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:59,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:46:59,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:46:59,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:59,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:46:59,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:46:59,469 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 7 states. [2019-12-27 16:47:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:00,453 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-27 16:47:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:47:00,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:47:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:00,556 INFO L225 Difference]: With dead ends: 64122 [2019-12-27 16:47:00,556 INFO L226 Difference]: Without dead ends: 64115 [2019-12-27 16:47:00,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:47:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-27 16:47:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-27 16:47:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:47:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-27 16:47:01,525 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-27 16:47:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:01,525 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-27 16:47:01,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:47:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-27 16:47:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:47:01,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:01,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:01,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:01,958 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-27 16:47:01,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:01,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612250384] [2019-12-27 16:47:01,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:02,017 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 16:47:02,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612250384] [2019-12-27 16:47:02,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:02,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:02,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053070218] [2019-12-27 16:47:02,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:02,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:02,032 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:47:02,032 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:02,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:02,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:47:02,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:47:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:02,052 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 5 states. [2019-12-27 16:47:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:02,138 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-27 16:47:02,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:02,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:47:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:02,161 INFO L225 Difference]: With dead ends: 17024 [2019-12-27 16:47:02,162 INFO L226 Difference]: Without dead ends: 17024 [2019-12-27 16:47:02,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-27 16:47:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-27 16:47:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-27 16:47:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-27 16:47:02,419 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-27 16:47:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:02,419 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-27 16:47:02,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:47:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-27 16:47:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:47:02,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:02,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:02,431 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-27 16:47:02,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:02,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717096556] [2019-12-27 16:47:02,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:02,480 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 16:47:02,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717096556] [2019-12-27 16:47:02,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:02,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:02,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007799508] [2019-12-27 16:47:02,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:02,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:02,491 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:47:02,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:02,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:02,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:02,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:02,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:02,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:02,492 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-27 16:47:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:02,601 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-27 16:47:02,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:02,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:47:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:02,636 INFO L225 Difference]: With dead ends: 24375 [2019-12-27 16:47:02,637 INFO L226 Difference]: Without dead ends: 24375 [2019-12-27 16:47:02,637 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 16:47:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-27 16:47:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-27 16:47:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-27 16:47:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-27 16:47:02,948 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-27 16:47:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:02,949 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-27 16:47:02,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-27 16:47:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:47:02,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:02,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:02,962 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:02,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:02,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-27 16:47:02,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:02,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998657338] [2019-12-27 16:47:02,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:03,042 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 16:47:03,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998657338] [2019-12-27 16:47:03,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:03,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:47:03,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1023104882] [2019-12-27 16:47:03,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:03,048 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:03,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:47:03,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:03,055 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:03,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:03,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:03,056 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-27 16:47:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:03,595 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-27 16:47:03,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:47:03,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:47:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:03,630 INFO L225 Difference]: With dead ends: 26038 [2019-12-27 16:47:03,630 INFO L226 Difference]: Without dead ends: 26038 [2019-12-27 16:47:03,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:47:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-27 16:47:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-27 16:47:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-27 16:47:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-27 16:47:03,963 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-27 16:47:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:03,964 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-27 16:47:03,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-27 16:47:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:47:03,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:03,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:03,984 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-27 16:47:03,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:03,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289861237] [2019-12-27 16:47:03,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:04,086 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 16:47:04,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289861237] [2019-12-27 16:47:04,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:04,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:47:04,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1702134455] [2019-12-27 16:47:04,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:04,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:04,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:47:04,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:04,122 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:04,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:47:04,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:04,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:47:04,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:47:04,123 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 8 states. [2019-12-27 16:47:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:05,273 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-27 16:47:05,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:47:05,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:47:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:05,314 INFO L225 Difference]: With dead ends: 28794 [2019-12-27 16:47:05,314 INFO L226 Difference]: Without dead ends: 28794 [2019-12-27 16:47:05,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:47:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-27 16:47:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-27 16:47:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-27 16:47:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-27 16:47:05,995 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-27 16:47:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:05,995 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-27 16:47:05,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:47:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-27 16:47:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:47:06,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:06,020 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] [2019-12-27 16:47:06,020 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:06,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-27 16:47:06,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:06,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850336649] [2019-12-27 16:47:06,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:06,111 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 16:47:06,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850336649] [2019-12-27 16:47:06,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:06,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:06,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066925332] [2019-12-27 16:47:06,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:06,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:06,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 355 transitions. [2019-12-27 16:47:06,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:06,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:47:06,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:06,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:06,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:06,213 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 6 states. [2019-12-27 16:47:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:06,383 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-27 16:47:06,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:06,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 16:47:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:06,415 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 16:47:06,416 INFO L226 Difference]: Without dead ends: 16657 [2019-12-27 16:47:06,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:06,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-27 16:47:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-27 16:47:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-27 16:47:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-27 16:47:06,694 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-27 16:47:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:06,694 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-27 16:47:06,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-27 16:47:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:47:06,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:06,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:06,714 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:06,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-27 16:47:06,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:06,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970457633] [2019-12-27 16:47:06,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:06,778 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 16:47:06,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970457633] [2019-12-27 16:47:06,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:06,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:47:06,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1544998450] [2019-12-27 16:47:06,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:06,787 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:06,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 16:47:06,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:06,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:06,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:06,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:06,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:06,851 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-27 16:47:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:06,927 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-27 16:47:06,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:06,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:47:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:06,953 INFO L225 Difference]: With dead ends: 16582 [2019-12-27 16:47:06,953 INFO L226 Difference]: Without dead ends: 16582 [2019-12-27 16:47:06,954 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 16:47:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-27 16:47:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-27 16:47:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-27 16:47:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-27 16:47:07,209 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-27 16:47:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:07,209 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-27 16:47:07,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-27 16:47:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:47:07,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:07,226 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] [2019-12-27 16:47:07,226 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:07,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-27 16:47:07,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:07,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241116702] [2019-12-27 16:47:07,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:07,297 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 16:47:07,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241116702] [2019-12-27 16:47:07,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:07,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:07,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746539240] [2019-12-27 16:47:07,298 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:07,307 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:07,341 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 16:47:07,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:07,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:07,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:47:07,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:07,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:47:07,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:07,354 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 5 states. [2019-12-27 16:47:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:07,800 INFO L93 Difference]: Finished difference Result 31293 states and 93283 transitions. [2019-12-27 16:47:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:47:07,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:47:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:07,834 INFO L225 Difference]: With dead ends: 31293 [2019-12-27 16:47:07,834 INFO L226 Difference]: Without dead ends: 16903 [2019-12-27 16:47:07,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2019-12-27 16:47:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 11605. [2019-12-27 16:47:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-27 16:47:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-27 16:47:08,065 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-27 16:47:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:08,065 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-27 16:47:08,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:47:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-27 16:47:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:47:08,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:08,077 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] [2019-12-27 16:47:08,077 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-27 16:47:08,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:08,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838289132] [2019-12-27 16:47:08,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:08,157 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 16:47:08,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838289132] [2019-12-27 16:47:08,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:08,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:47:08,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539196575] [2019-12-27 16:47:08,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:08,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:08,243 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 16:47:08,243 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:08,286 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:08,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:47:08,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:08,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:47:08,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:08,288 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 7 states. [2019-12-27 16:47:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:08,347 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-27 16:47:08,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:47:08,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:47:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:08,360 INFO L225 Difference]: With dead ends: 10656 [2019-12-27 16:47:08,361 INFO L226 Difference]: Without dead ends: 7573 [2019-12-27 16:47:08,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-27 16:47:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-27 16:47:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-27 16:47:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-27 16:47:08,505 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-27 16:47:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:08,505 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-27 16:47:08,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:47:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-27 16:47:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:08,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:08,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:08,518 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-27 16:47:08,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:08,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52253392] [2019-12-27 16:47:08,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:08,578 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 16:47:08,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52253392] [2019-12-27 16:47:08,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:08,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:08,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128701488] [2019-12-27 16:47:08,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:08,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:08,943 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 16:47:08,943 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:08,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:47:08,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:08,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:08,961 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-27 16:47:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:09,032 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-27 16:47:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:09,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:47:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:09,052 INFO L225 Difference]: With dead ends: 10082 [2019-12-27 16:47:09,052 INFO L226 Difference]: Without dead ends: 10082 [2019-12-27 16:47:09,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 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 16:47:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-27 16:47:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-27 16:47:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-27 16:47:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-27 16:47:09,256 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-27 16:47:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:09,256 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-27 16:47:09,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-27 16:47:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:09,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:09,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:09,266 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-27 16:47:09,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:09,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406658672] [2019-12-27 16:47:09,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:47:09,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406658672] [2019-12-27 16:47:09,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:09,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:47:09,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132140795] [2019-12-27 16:47:09,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:09,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:09,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 16:47:09,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:09,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:47:09,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:47:09,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:09,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:47:09,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:47:09,864 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 15 states. [2019-12-27 16:47:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:12,086 INFO L93 Difference]: Finished difference Result 25820 states and 78978 transitions. [2019-12-27 16:47:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 16:47:12,087 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2019-12-27 16:47:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:12,115 INFO L225 Difference]: With dead ends: 25820 [2019-12-27 16:47:12,116 INFO L226 Difference]: Without dead ends: 19646 [2019-12-27 16:47:12,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:47:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19646 states. [2019-12-27 16:47:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19646 to 9445. [2019-12-27 16:47:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-27 16:47:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-27 16:47:12,339 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-27 16:47:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:12,339 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-27 16:47:12,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:47:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-27 16:47:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:12,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:12,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:12,350 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-27 16:47:12,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:12,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211406064] [2019-12-27 16:47:12,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:12,500 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 16:47:12,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211406064] [2019-12-27 16:47:12,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:12,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:47:12,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1861496263] [2019-12-27 16:47:12,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:12,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:12,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 348 transitions. [2019-12-27 16:47:12,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:12,928 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:47:12,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:47:12,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:12,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:47:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:47:12,929 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 14 states. [2019-12-27 16:47:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:15,055 INFO L93 Difference]: Finished difference Result 24845 states and 77092 transitions. [2019-12-27 16:47:15,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:47:15,055 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 16:47:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:15,082 INFO L225 Difference]: With dead ends: 24845 [2019-12-27 16:47:15,082 INFO L226 Difference]: Without dead ends: 17631 [2019-12-27 16:47:15,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:47:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17631 states. [2019-12-27 16:47:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17631 to 11056. [2019-12-27 16:47:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11056 states. [2019-12-27 16:47:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11056 states to 11056 states and 34695 transitions. [2019-12-27 16:47:15,326 INFO L78 Accepts]: Start accepts. Automaton has 11056 states and 34695 transitions. Word has length 64 [2019-12-27 16:47:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:15,326 INFO L462 AbstractCegarLoop]: Abstraction has 11056 states and 34695 transitions. [2019-12-27 16:47:15,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:47:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11056 states and 34695 transitions. [2019-12-27 16:47:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:15,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:15,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:15,344 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-27 16:47:15,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:15,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199457682] [2019-12-27 16:47:15,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:15,465 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 16:47:15,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199457682] [2019-12-27 16:47:15,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:15,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:15,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087913842] [2019-12-27 16:47:15,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:15,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:15,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 245 transitions. [2019-12-27 16:47:15,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:15,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:15,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:47:15,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:47:15,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:47:15,802 INFO L87 Difference]: Start difference. First operand 11056 states and 34695 transitions. Second operand 13 states. [2019-12-27 16:47:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:18,470 INFO L93 Difference]: Finished difference Result 33680 states and 103747 transitions. [2019-12-27 16:47:18,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 16:47:18,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:47:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:18,518 INFO L225 Difference]: With dead ends: 33680 [2019-12-27 16:47:18,518 INFO L226 Difference]: Without dead ends: 31192 [2019-12-27 16:47:18,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=505, Invalid=1945, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 16:47:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31192 states. [2019-12-27 16:47:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31192 to 10916. [2019-12-27 16:47:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10916 states. [2019-12-27 16:47:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10916 states to 10916 states and 34289 transitions. [2019-12-27 16:47:18,932 INFO L78 Accepts]: Start accepts. Automaton has 10916 states and 34289 transitions. Word has length 64 [2019-12-27 16:47:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:18,932 INFO L462 AbstractCegarLoop]: Abstraction has 10916 states and 34289 transitions. [2019-12-27 16:47:18,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:47:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10916 states and 34289 transitions. [2019-12-27 16:47:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:18,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:18,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:18,943 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:18,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:18,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 4 times [2019-12-27 16:47:18,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:18,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090440467] [2019-12-27 16:47:18,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:19,011 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 16:47:19,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090440467] [2019-12-27 16:47:19,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:19,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:19,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523683866] [2019-12-27 16:47:19,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:19,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:19,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 558 transitions. [2019-12-27 16:47:19,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:19,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:19,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:19,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:19,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:19,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:19,439 INFO L87 Difference]: Start difference. First operand 10916 states and 34289 transitions. Second operand 3 states. [2019-12-27 16:47:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:19,570 INFO L93 Difference]: Finished difference Result 12632 states and 39593 transitions. [2019-12-27 16:47:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:19,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:47:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:19,595 INFO L225 Difference]: With dead ends: 12632 [2019-12-27 16:47:19,596 INFO L226 Difference]: Without dead ends: 12632 [2019-12-27 16:47:19,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 4 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 16:47:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12632 states. [2019-12-27 16:47:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12632 to 11384. [2019-12-27 16:47:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2019-12-27 16:47:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 35849 transitions. [2019-12-27 16:47:19,896 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 35849 transitions. Word has length 64 [2019-12-27 16:47:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:19,896 INFO L462 AbstractCegarLoop]: Abstraction has 11384 states and 35849 transitions. [2019-12-27 16:47:19,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 35849 transitions. [2019-12-27 16:47:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:19,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:19,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:19,911 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-27 16:47:19,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:19,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833430364] [2019-12-27 16:47:19,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:20,032 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 16:47:20,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833430364] [2019-12-27 16:47:20,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:20,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:47:20,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1914424811] [2019-12-27 16:47:20,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:20,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:20,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 264 transitions. [2019-12-27 16:47:20,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:20,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:47:20,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:47:20,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:20,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:47:20,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:47:20,510 INFO L87 Difference]: Start difference. First operand 11384 states and 35849 transitions. Second operand 13 states. [2019-12-27 16:47:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:24,789 INFO L93 Difference]: Finished difference Result 56068 states and 173510 transitions. [2019-12-27 16:47:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 16:47:24,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:47:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:24,853 INFO L225 Difference]: With dead ends: 56068 [2019-12-27 16:47:24,854 INFO L226 Difference]: Without dead ends: 44689 [2019-12-27 16:47:24,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 16:47:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44689 states. [2019-12-27 16:47:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44689 to 14995. [2019-12-27 16:47:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14995 states. [2019-12-27 16:47:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14995 states to 14995 states and 47906 transitions. [2019-12-27 16:47:25,356 INFO L78 Accepts]: Start accepts. Automaton has 14995 states and 47906 transitions. Word has length 65 [2019-12-27 16:47:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:25,356 INFO L462 AbstractCegarLoop]: Abstraction has 14995 states and 47906 transitions. [2019-12-27 16:47:25,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:47:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14995 states and 47906 transitions. [2019-12-27 16:47:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:25,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:25,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:25,375 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:25,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:25,375 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-27 16:47:25,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:25,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861156322] [2019-12-27 16:47:25,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:25,512 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 16:47:25,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861156322] [2019-12-27 16:47:25,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:25,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:25,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [80018005] [2019-12-27 16:47:25,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:25,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:25,735 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 270 transitions. [2019-12-27 16:47:25,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:25,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:25,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:47:25,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:47:25,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:25,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:47:25,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:47:25,991 INFO L87 Difference]: Start difference. First operand 14995 states and 47906 transitions. Second operand 16 states. [2019-12-27 16:47:31,591 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-27 16:47:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:35,440 INFO L93 Difference]: Finished difference Result 68761 states and 211276 transitions. [2019-12-27 16:47:35,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-27 16:47:35,442 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 16:47:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:35,526 INFO L225 Difference]: With dead ends: 68761 [2019-12-27 16:47:35,526 INFO L226 Difference]: Without dead ends: 58612 [2019-12-27 16:47:35,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5123 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1963, Invalid=11377, Unknown=0, NotChecked=0, Total=13340 [2019-12-27 16:47:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58612 states. [2019-12-27 16:47:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58612 to 14575. [2019-12-27 16:47:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14575 states. [2019-12-27 16:47:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14575 states to 14575 states and 46485 transitions. [2019-12-27 16:47:36,118 INFO L78 Accepts]: Start accepts. Automaton has 14575 states and 46485 transitions. Word has length 65 [2019-12-27 16:47:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:36,118 INFO L462 AbstractCegarLoop]: Abstraction has 14575 states and 46485 transitions. [2019-12-27 16:47:36,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:47:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14575 states and 46485 transitions. [2019-12-27 16:47:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:36,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:36,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:36,137 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash 597443054, now seen corresponding path program 3 times [2019-12-27 16:47:36,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:36,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329135738] [2019-12-27 16:47:36,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:36,280 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 16:47:36,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329135738] [2019-12-27 16:47:36,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:36,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:36,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582042819] [2019-12-27 16:47:36,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:36,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:36,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 282 transitions. [2019-12-27 16:47:36,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:36,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:47:36,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:47:36,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:36,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:47:36,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:47:36,551 INFO L87 Difference]: Start difference. First operand 14575 states and 46485 transitions. Second operand 11 states. [2019-12-27 16:47:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:37,704 INFO L93 Difference]: Finished difference Result 39752 states and 121974 transitions. [2019-12-27 16:47:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:47:37,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 16:47:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:37,754 INFO L225 Difference]: With dead ends: 39752 [2019-12-27 16:47:37,754 INFO L226 Difference]: Without dead ends: 35992 [2019-12-27 16:47:37,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:47:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35992 states. [2019-12-27 16:47:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35992 to 14470. [2019-12-27 16:47:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14470 states. [2019-12-27 16:47:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14470 states to 14470 states and 46039 transitions. [2019-12-27 16:47:38,262 INFO L78 Accepts]: Start accepts. Automaton has 14470 states and 46039 transitions. Word has length 65 [2019-12-27 16:47:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:38,262 INFO L462 AbstractCegarLoop]: Abstraction has 14470 states and 46039 transitions. [2019-12-27 16:47:38,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:47:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 14470 states and 46039 transitions. [2019-12-27 16:47:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:38,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:38,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:38,278 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1262085647, now seen corresponding path program 1 times [2019-12-27 16:47:38,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:38,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699774373] [2019-12-27 16:47:38,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:38,359 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 16:47:38,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699774373] [2019-12-27 16:47:38,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:38,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:38,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [243506245] [2019-12-27 16:47:38,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:38,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:38,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 502 transitions. [2019-12-27 16:47:38,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:38,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:38,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:47:38,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:38,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:47:38,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:47:38,769 INFO L87 Difference]: Start difference. First operand 14470 states and 46039 transitions. Second operand 4 states. [2019-12-27 16:47:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:38,938 INFO L93 Difference]: Finished difference Result 14314 states and 45415 transitions. [2019-12-27 16:47:38,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:38,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:47:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:38,975 INFO L225 Difference]: With dead ends: 14314 [2019-12-27 16:47:38,975 INFO L226 Difference]: Without dead ends: 14314 [2019-12-27 16:47:38,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 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 16:47:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14314 states. [2019-12-27 16:47:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14314 to 13846. [2019-12-27 16:47:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13846 states. [2019-12-27 16:47:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13846 states to 13846 states and 43855 transitions. [2019-12-27 16:47:39,398 INFO L78 Accepts]: Start accepts. Automaton has 13846 states and 43855 transitions. Word has length 65 [2019-12-27 16:47:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:39,399 INFO L462 AbstractCegarLoop]: Abstraction has 13846 states and 43855 transitions. [2019-12-27 16:47:39,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:47:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13846 states and 43855 transitions. [2019-12-27 16:47:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:39,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:39,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:39,421 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:39,422 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-27 16:47:39,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:39,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066568605] [2019-12-27 16:47:39,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:39,821 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 16:47:39,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066568605] [2019-12-27 16:47:39,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:39,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:47:39,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795630667] [2019-12-27 16:47:39,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:39,856 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:40,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 377 transitions. [2019-12-27 16:47:40,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:40,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:47:40,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:47:40,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 16:47:40,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 16:47:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:47:40,479 INFO L87 Difference]: Start difference. First operand 13846 states and 43855 transitions. Second operand 19 states. [2019-12-27 16:47:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:45,025 INFO L93 Difference]: Finished difference Result 35389 states and 107198 transitions. [2019-12-27 16:47:45,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 16:47:45,026 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-12-27 16:47:45,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:45,076 INFO L225 Difference]: With dead ends: 35389 [2019-12-27 16:47:45,076 INFO L226 Difference]: Without dead ends: 35137 [2019-12-27 16:47:45,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 16:47:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states. [2019-12-27 16:47:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 20698. [2019-12-27 16:47:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20698 states. [2019-12-27 16:47:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20698 states to 20698 states and 63675 transitions. [2019-12-27 16:47:45,516 INFO L78 Accepts]: Start accepts. Automaton has 20698 states and 63675 transitions. Word has length 65 [2019-12-27 16:47:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:45,516 INFO L462 AbstractCegarLoop]: Abstraction has 20698 states and 63675 transitions. [2019-12-27 16:47:45,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 16:47:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 20698 states and 63675 transitions. [2019-12-27 16:47:45,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:45,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:45,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:45,538 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash -130492415, now seen corresponding path program 2 times [2019-12-27 16:47:45,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:45,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979996004] [2019-12-27 16:47:45,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:45,785 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 16:47:45,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979996004] [2019-12-27 16:47:45,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:45,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 16:47:45,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [723843066] [2019-12-27 16:47:45,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:45,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:46,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 343 transitions. [2019-12-27 16:47:46,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:46,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:46,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:47:46,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:47:46,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:47:46,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:46,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:47:46,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:47:46,381 INFO L87 Difference]: Start difference. First operand 20698 states and 63675 transitions. Second operand 16 states. [2019-12-27 16:47:49,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:49,978 INFO L93 Difference]: Finished difference Result 36034 states and 106906 transitions. [2019-12-27 16:47:49,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 16:47:49,979 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 16:47:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:50,026 INFO L225 Difference]: With dead ends: 36034 [2019-12-27 16:47:50,026 INFO L226 Difference]: Without dead ends: 35814 [2019-12-27 16:47:50,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 16:47:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35814 states. [2019-12-27 16:47:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35814 to 23472. [2019-12-27 16:47:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23472 states. [2019-12-27 16:47:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23472 states to 23472 states and 70966 transitions. [2019-12-27 16:47:50,649 INFO L78 Accepts]: Start accepts. Automaton has 23472 states and 70966 transitions. Word has length 65 [2019-12-27 16:47:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:50,649 INFO L462 AbstractCegarLoop]: Abstraction has 23472 states and 70966 transitions. [2019-12-27 16:47:50,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:47:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 23472 states and 70966 transitions. [2019-12-27 16:47:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:50,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:50,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:50,674 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1979760167, now seen corresponding path program 3 times [2019-12-27 16:47:50,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:50,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218883101] [2019-12-27 16:47:50,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:50,738 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 16:47:50,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218883101] [2019-12-27 16:47:50,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:50,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:50,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1899761526] [2019-12-27 16:47:50,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:50,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:50,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 280 transitions. [2019-12-27 16:47:50,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:50,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:47:50,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:50,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:50,976 INFO L87 Difference]: Start difference. First operand 23472 states and 70966 transitions. Second operand 6 states. [2019-12-27 16:47:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:51,385 INFO L93 Difference]: Finished difference Result 20981 states and 62527 transitions. [2019-12-27 16:47:51,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:47:51,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 16:47:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:51,431 INFO L225 Difference]: With dead ends: 20981 [2019-12-27 16:47:51,431 INFO L226 Difference]: Without dead ends: 20981 [2019-12-27 16:47:51,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20981 states. [2019-12-27 16:47:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20981 to 16371. [2019-12-27 16:47:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16371 states. [2019-12-27 16:47:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16371 states to 16371 states and 49257 transitions. [2019-12-27 16:47:51,903 INFO L78 Accepts]: Start accepts. Automaton has 16371 states and 49257 transitions. Word has length 65 [2019-12-27 16:47:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:51,904 INFO L462 AbstractCegarLoop]: Abstraction has 16371 states and 49257 transitions. [2019-12-27 16:47:51,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 16371 states and 49257 transitions. [2019-12-27 16:47:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:51,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:51,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:51,923 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1324094588, now seen corresponding path program 1 times [2019-12-27 16:47:51,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:51,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084145230] [2019-12-27 16:47:51,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:52,106 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 16:47:52,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084145230] [2019-12-27 16:47:52,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:52,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:52,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955757512] [2019-12-27 16:47:52,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:52,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:52,301 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 333 transitions. [2019-12-27 16:47:52,301 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:52,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:52,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:52,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:52,788 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:47:52,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:52,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:52,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:52,790 INFO L87 Difference]: Start difference. First operand 16371 states and 49257 transitions. Second operand 18 states. [2019-12-27 16:47:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:55,760 INFO L93 Difference]: Finished difference Result 27559 states and 81682 transitions. [2019-12-27 16:47:55,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:47:55,761 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:47:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:55,789 INFO L225 Difference]: With dead ends: 27559 [2019-12-27 16:47:55,789 INFO L226 Difference]: Without dead ends: 20817 [2019-12-27 16:47:55,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-27 16:47:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20817 states. [2019-12-27 16:47:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20817 to 16968. [2019-12-27 16:47:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16968 states. [2019-12-27 16:47:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16968 states to 16968 states and 50846 transitions. [2019-12-27 16:47:56,073 INFO L78 Accepts]: Start accepts. Automaton has 16968 states and 50846 transitions. Word has length 66 [2019-12-27 16:47:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:56,074 INFO L462 AbstractCegarLoop]: Abstraction has 16968 states and 50846 transitions. [2019-12-27 16:47:56,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:47:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 16968 states and 50846 transitions. [2019-12-27 16:47:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:56,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:56,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:56,090 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:56,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1320774952, now seen corresponding path program 2 times [2019-12-27 16:47:56,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:56,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702911525] [2019-12-27 16:47:56,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:56,250 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 16:47:56,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702911525] [2019-12-27 16:47:56,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:56,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:56,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831659430] [2019-12-27 16:47:56,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:56,353 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:56,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 340 transitions. [2019-12-27 16:47:56,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:56,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:56,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:56,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:56,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:47:56,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:56,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:56,911 INFO L87 Difference]: Start difference. First operand 16968 states and 50846 transitions. Second operand 18 states. [2019-12-27 16:48:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:00,301 INFO L93 Difference]: Finished difference Result 30229 states and 89187 transitions. [2019-12-27 16:48:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 16:48:00,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:48:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:00,338 INFO L225 Difference]: With dead ends: 30229 [2019-12-27 16:48:00,338 INFO L226 Difference]: Without dead ends: 25948 [2019-12-27 16:48:00,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:48:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25948 states. [2019-12-27 16:48:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25948 to 17375. [2019-12-27 16:48:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17375 states. [2019-12-27 16:48:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 51791 transitions. [2019-12-27 16:48:00,683 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 51791 transitions. Word has length 66 [2019-12-27 16:48:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:00,683 INFO L462 AbstractCegarLoop]: Abstraction has 17375 states and 51791 transitions. [2019-12-27 16:48:00,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:48:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 51791 transitions. [2019-12-27 16:48:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:00,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:00,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:00,700 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash -961619660, now seen corresponding path program 3 times [2019-12-27 16:48:00,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:00,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588525010] [2019-12-27 16:48:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:00,852 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 16:48:00,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588525010] [2019-12-27 16:48:00,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:00,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:00,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251663077] [2019-12-27 16:48:00,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:00,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:01,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 481 transitions. [2019-12-27 16:48:01,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:01,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:01,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:01,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:01,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:01,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:48:01,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:48:01,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:01,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:48:01,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:48:01,584 INFO L87 Difference]: Start difference. First operand 17375 states and 51791 transitions. Second operand 21 states. [2019-12-27 16:48:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:04,211 INFO L93 Difference]: Finished difference Result 25475 states and 74589 transitions. [2019-12-27 16:48:04,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:48:04,212 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-27 16:48:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:04,241 INFO L225 Difference]: With dead ends: 25475 [2019-12-27 16:48:04,241 INFO L226 Difference]: Without dead ends: 21471 [2019-12-27 16:48:04,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-12-27 16:48:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21471 states. [2019-12-27 16:48:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21471 to 17036. [2019-12-27 16:48:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17036 states. [2019-12-27 16:48:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17036 states to 17036 states and 50827 transitions. [2019-12-27 16:48:04,541 INFO L78 Accepts]: Start accepts. Automaton has 17036 states and 50827 transitions. Word has length 66 [2019-12-27 16:48:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:04,541 INFO L462 AbstractCegarLoop]: Abstraction has 17036 states and 50827 transitions. [2019-12-27 16:48:04,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:48:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17036 states and 50827 transitions. [2019-12-27 16:48:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:04,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:04,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:04,558 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:04,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1444762494, now seen corresponding path program 4 times [2019-12-27 16:48:04,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:04,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300969914] [2019-12-27 16:48:04,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:04,716 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 16:48:04,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300969914] [2019-12-27 16:48:04,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:04,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:04,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1748872387] [2019-12-27 16:48:04,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:04,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:05,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 323 transitions. [2019-12-27 16:48:05,027 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:05,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:05,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:05,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:05,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:48:05,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 16:48:05,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 16:48:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:48:05,764 INFO L87 Difference]: Start difference. First operand 17036 states and 50827 transitions. Second operand 24 states. [2019-12-27 16:48:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:13,586 INFO L93 Difference]: Finished difference Result 52997 states and 155530 transitions. [2019-12-27 16:48:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-27 16:48:13,587 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2019-12-27 16:48:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:13,648 INFO L225 Difference]: With dead ends: 52997 [2019-12-27 16:48:13,648 INFO L226 Difference]: Without dead ends: 43779 [2019-12-27 16:48:13,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5785 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2093, Invalid=14677, Unknown=0, NotChecked=0, Total=16770 [2019-12-27 16:48:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43779 states. [2019-12-27 16:48:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43779 to 23046. [2019-12-27 16:48:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23046 states. [2019-12-27 16:48:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23046 states to 23046 states and 68661 transitions. [2019-12-27 16:48:14,160 INFO L78 Accepts]: Start accepts. Automaton has 23046 states and 68661 transitions. Word has length 66 [2019-12-27 16:48:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:14,160 INFO L462 AbstractCegarLoop]: Abstraction has 23046 states and 68661 transitions. [2019-12-27 16:48:14,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 16:48:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 23046 states and 68661 transitions. [2019-12-27 16:48:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:14,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:14,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:14,186 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash -336670156, now seen corresponding path program 5 times [2019-12-27 16:48:14,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:14,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554609348] [2019-12-27 16:48:14,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:14,319 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 16:48:14,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554609348] [2019-12-27 16:48:14,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:14,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:14,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1362624682] [2019-12-27 16:48:14,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:14,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:14,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 469 transitions. [2019-12-27 16:48:14,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:15,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:15,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:15,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:15,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 16:48:15,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:48:15,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:15,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:48:15,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:48:15,166 INFO L87 Difference]: Start difference. First operand 23046 states and 68661 transitions. Second operand 20 states. [2019-12-27 16:48:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:16,423 INFO L93 Difference]: Finished difference Result 28208 states and 82897 transitions. [2019-12-27 16:48:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 16:48:16,423 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 16:48:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:16,456 INFO L225 Difference]: With dead ends: 28208 [2019-12-27 16:48:16,456 INFO L226 Difference]: Without dead ends: 25147 [2019-12-27 16:48:16,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 16:48:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25147 states. [2019-12-27 16:48:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25147 to 21425. [2019-12-27 16:48:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21425 states. [2019-12-27 16:48:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21425 states to 21425 states and 63983 transitions. [2019-12-27 16:48:16,812 INFO L78 Accepts]: Start accepts. Automaton has 21425 states and 63983 transitions. Word has length 66 [2019-12-27 16:48:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:16,812 INFO L462 AbstractCegarLoop]: Abstraction has 21425 states and 63983 transitions. [2019-12-27 16:48:16,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:48:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 21425 states and 63983 transitions. [2019-12-27 16:48:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:16,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:16,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:16,835 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:16,835 INFO L82 PathProgramCache]: Analyzing trace with hash -85497452, now seen corresponding path program 6 times [2019-12-27 16:48:16,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:16,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378384949] [2019-12-27 16:48:16,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:17,187 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 16:48:17,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378384949] [2019-12-27 16:48:17,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:17,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:48:17,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373257688] [2019-12-27 16:48:17,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:17,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:17,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 303 states and 545 transitions. [2019-12-27 16:48:17,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:48:18,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 16:48:18,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 16:48:18,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:18,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 16:48:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:48:18,543 INFO L87 Difference]: Start difference. First operand 21425 states and 63983 transitions. Second operand 23 states. [2019-12-27 16:48:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:25,858 INFO L93 Difference]: Finished difference Result 52470 states and 150663 transitions. [2019-12-27 16:48:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 16:48:25,859 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-27 16:48:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:25,930 INFO L225 Difference]: With dead ends: 52470 [2019-12-27 16:48:25,930 INFO L226 Difference]: Without dead ends: 52302 [2019-12-27 16:48:25,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 33 SyntacticMatches, 13 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1307, Invalid=5173, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 16:48:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52302 states. [2019-12-27 16:48:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52302 to 19398. [2019-12-27 16:48:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19398 states. [2019-12-27 16:48:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19398 states to 19398 states and 57344 transitions. [2019-12-27 16:48:26,479 INFO L78 Accepts]: Start accepts. Automaton has 19398 states and 57344 transitions. Word has length 66 [2019-12-27 16:48:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:26,480 INFO L462 AbstractCegarLoop]: Abstraction has 19398 states and 57344 transitions. [2019-12-27 16:48:26,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 16:48:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19398 states and 57344 transitions. [2019-12-27 16:48:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:26,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:26,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:26,499 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1622676514, now seen corresponding path program 7 times [2019-12-27 16:48:26,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:26,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146706519] [2019-12-27 16:48:26,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:26,568 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 16:48:26,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146706519] [2019-12-27 16:48:26,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:26,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:26,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797979367] [2019-12-27 16:48:26,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:26,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:27,101 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 309 states and 552 transitions. [2019-12-27 16:48:27,101 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:27,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:27,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:27,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:27,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:27,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:27,103 INFO L87 Difference]: Start difference. First operand 19398 states and 57344 transitions. Second operand 3 states. [2019-12-27 16:48:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:27,202 INFO L93 Difference]: Finished difference Result 19397 states and 57342 transitions. [2019-12-27 16:48:27,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:27,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:48:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:27,239 INFO L225 Difference]: With dead ends: 19397 [2019-12-27 16:48:27,239 INFO L226 Difference]: Without dead ends: 19397 [2019-12-27 16:48:27,240 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 16:48:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19397 states. [2019-12-27 16:48:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19397 to 16595. [2019-12-27 16:48:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16595 states. [2019-12-27 16:48:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16595 states to 16595 states and 49415 transitions. [2019-12-27 16:48:27,618 INFO L78 Accepts]: Start accepts. Automaton has 16595 states and 49415 transitions. Word has length 66 [2019-12-27 16:48:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:27,618 INFO L462 AbstractCegarLoop]: Abstraction has 16595 states and 49415 transitions. [2019-12-27 16:48:27,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 16595 states and 49415 transitions. [2019-12-27 16:48:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:27,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:27,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:27,635 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 1 times [2019-12-27 16:48:27,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:27,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439400253] [2019-12-27 16:48:27,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:27,778 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:48:27,779 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:48:27,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25| 1)) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t861~0.offset_17|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t861~0.base_25| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25|) |v_ULTIMATE.start_main_~#t861~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t861~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25|) 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start_main_~#t861~0.base=|v_ULTIMATE.start_main_~#t861~0.base_25|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t861~0.offset=|v_ULTIMATE.start_main_~#t861~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_17|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_21|, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t861~0.base, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t861~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t863~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t862~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_~#t863~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 16:48:27,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t862~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t862~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t862~0.offset_9| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10|) |v_ULTIMATE.start_main_~#t862~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t862~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t862~0.base, #length] because there is no mapped edge [2019-12-27 16:48:27,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t863~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13|) |v_ULTIMATE.start_main_~#t863~0.offset_11| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t863~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t863~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_11|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t863~0.offset, ULTIMATE.start_main_~#t863~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 16:48:27,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~b$r_buff1_thd3~0_Out337790613 ~b$r_buff0_thd3~0_In337790613) (= ~__unbuffered_p0_EAX~0_Out337790613 ~x~0_In337790613) (= ~b$r_buff1_thd0~0_Out337790613 ~b$r_buff0_thd0~0_In337790613) (= 1 ~b$r_buff0_thd1~0_Out337790613) (= ~b$r_buff0_thd1~0_In337790613 ~b$r_buff1_thd1~0_Out337790613) (= ~b$r_buff0_thd2~0_In337790613 ~b$r_buff1_thd2~0_Out337790613) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In337790613))) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In337790613, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In337790613, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In337790613, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In337790613, ~x~0=~x~0_In337790613, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In337790613} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out337790613, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In337790613, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out337790613, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In337790613, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out337790613, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out337790613, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In337790613, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out337790613, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out337790613, ~x~0=~x~0_In337790613, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In337790613} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 16:48:27,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-740298771 256) 0)) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In-740298771 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out-740298771| ~b$w_buff1~0_In-740298771) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out-740298771| ~b~0_In-740298771)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-740298771, ~b~0=~b~0_In-740298771, ~b$w_buff1~0=~b$w_buff1~0_In-740298771, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-740298771} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In-740298771, ~b~0=~b~0_In-740298771, ~b$w_buff1~0=~b$w_buff1~0_In-740298771, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-740298771|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-740298771} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:48:27,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:48:27,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In50740794 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In50740794 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out50740794|)) (and (= ~b$w_buff0_used~0_In50740794 |P1Thread1of1ForFork0_#t~ite11_Out50740794|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In50740794, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In50740794} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In50740794, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In50740794, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out50740794|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 16:48:27,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd2~0_In862237591 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In862237591 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In862237591 256))) (.cse3 (= (mod ~b$r_buff1_thd2~0_In862237591 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out862237591|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~b$w_buff1_used~0_In862237591 |P1Thread1of1ForFork0_#t~ite12_Out862237591|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In862237591, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In862237591, ~b$w_buff1_used~0=~b$w_buff1_used~0_In862237591, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In862237591} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In862237591, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In862237591, ~b$w_buff1_used~0=~b$w_buff1_used~0_In862237591, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out862237591|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In862237591} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 16:48:27,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In1304621756 256))) (.cse0 (= (mod ~b$r_buff0_thd2~0_In1304621756 256) 0))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd2~0_In1304621756 |P1Thread1of1ForFork0_#t~ite13_Out1304621756|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1304621756|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1304621756, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1304621756} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1304621756, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1304621756, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1304621756|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 16:48:27,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~b$w_buff1_used~0_In-45115231 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd2~0_In-45115231 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-45115231 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd2~0_In-45115231 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$r_buff1_thd2~0_In-45115231 |P1Thread1of1ForFork0_#t~ite14_Out-45115231|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-45115231|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-45115231, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-45115231, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-45115231, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-45115231} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-45115231, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-45115231, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-45115231, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-45115231|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-45115231} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 16:48:27,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 16:48:27,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1266055678 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_In-1266055678| |P2Thread1of1ForFork1_#t~ite20_Out-1266055678|) (not .cse0) (= ~b$w_buff0~0_In-1266055678 |P2Thread1of1ForFork1_#t~ite21_Out-1266055678|)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite20_Out-1266055678| ~b$w_buff0~0_In-1266055678) (= |P2Thread1of1ForFork1_#t~ite20_Out-1266055678| |P2Thread1of1ForFork1_#t~ite21_Out-1266055678|) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1266055678 256) 0))) (or (= (mod ~b$w_buff0_used~0_In-1266055678 256) 0) (and (= (mod ~b$w_buff1_used~0_In-1266055678 256) 0) .cse1) (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-1266055678 256)))))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1266055678, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1266055678, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1266055678|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1266055678, ~b$w_buff0~0=~b$w_buff0~0_In-1266055678, ~weak$$choice2~0=~weak$$choice2~0_In-1266055678, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1266055678} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1266055678, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1266055678, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1266055678|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1266055678|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1266055678, ~b$w_buff0~0=~b$w_buff0~0_In-1266055678, ~weak$$choice2~0=~weak$$choice2~0_In-1266055678, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1266055678} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 16:48:27,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2128019220 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out2128019220| ~b$w_buff0_used~0_In2128019220) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In2128019220 256)))) (or (= (mod ~b$w_buff0_used~0_In2128019220 256) 0) (and (= 0 (mod ~b$r_buff1_thd3~0_In2128019220 256)) .cse1) (and (= 0 (mod ~b$w_buff1_used~0_In2128019220 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite26_Out2128019220| |P2Thread1of1ForFork1_#t~ite27_Out2128019220|)) (and (= |P2Thread1of1ForFork1_#t~ite26_In2128019220| |P2Thread1of1ForFork1_#t~ite26_Out2128019220|) (= |P2Thread1of1ForFork1_#t~ite27_Out2128019220| ~b$w_buff0_used~0_In2128019220) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2128019220, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2128019220, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In2128019220|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2128019220, ~weak$$choice2~0=~weak$$choice2~0_In2128019220, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2128019220} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2128019220, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out2128019220|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2128019220, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out2128019220|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2128019220, ~weak$$choice2~0=~weak$$choice2~0_In2128019220, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2128019220} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 16:48:27,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:48:27,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 16:48:27,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In1158321458 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In1158321458 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out1158321458| ~b~0_In1158321458)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out1158321458| ~b$w_buff1~0_In1158321458) (not .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1158321458, ~b~0=~b~0_In1158321458, ~b$w_buff1~0=~b$w_buff1~0_In1158321458, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1158321458} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1158321458|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1158321458, ~b~0=~b~0_In1158321458, ~b$w_buff1~0=~b$w_buff1~0_In1158321458, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1158321458} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 16:48:27,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 16:48:27,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-807189251 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-807189251 256)))) (or (and (= ~b$w_buff0_used~0_In-807189251 |P2Thread1of1ForFork1_#t~ite40_Out-807189251|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-807189251| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-807189251, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-807189251} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-807189251, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-807189251, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-807189251|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 16:48:27,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1459891929 256))) (.cse2 (= (mod ~b$r_buff1_thd3~0_In-1459891929 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1459891929 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1459891929 256)))) (or (and (= ~b$w_buff1_used~0_In-1459891929 |P2Thread1of1ForFork1_#t~ite41_Out-1459891929|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-1459891929|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1459891929, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1459891929, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1459891929, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1459891929} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1459891929, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1459891929, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1459891929, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1459891929|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1459891929} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 16:48:27,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In886888038 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In886888038 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite42_Out886888038| ~b$r_buff0_thd3~0_In886888038) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out886888038| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In886888038, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In886888038} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In886888038, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In886888038, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out886888038|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 16:48:27,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In2096208708 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In2096208708 256) 0)) (.cse2 (= (mod ~b$r_buff1_thd3~0_In2096208708 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In2096208708 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite43_Out2096208708|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite43_Out2096208708| ~b$r_buff1_thd3~0_In2096208708) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2096208708, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2096208708, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2096208708, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2096208708} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2096208708, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2096208708, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out2096208708|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2096208708, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2096208708} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 16:48:27,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 16:48:27,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd1~0_In-1850809648 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1850809648 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-1850809648|) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-1850809648 |P0Thread1of1ForFork2_#t~ite5_Out-1850809648|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1850809648, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1850809648} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1850809648, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1850809648, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1850809648|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 16:48:27,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd1~0_In113995089 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In113995089 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In113995089 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In113995089 256) 0))) (or (and (= ~b$w_buff1_used~0_In113995089 |P0Thread1of1ForFork2_#t~ite6_Out113995089|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite6_Out113995089| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In113995089, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In113995089, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In113995089, ~b$w_buff1_used~0=~b$w_buff1_used~0_In113995089} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In113995089, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In113995089, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In113995089, ~b$w_buff1_used~0=~b$w_buff1_used~0_In113995089, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out113995089|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 16:48:27,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-2037912440 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In-2037912440 256)))) (or (and (= ~b$r_buff0_thd1~0_In-2037912440 ~b$r_buff0_thd1~0_Out-2037912440) (or .cse0 .cse1)) (and (= 0 ~b$r_buff0_thd1~0_Out-2037912440) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2037912440, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-2037912440} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2037912440, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-2037912440, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-2037912440|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 16:48:27,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In-199039435 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd1~0_In-199039435 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-199039435 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-199039435 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite8_Out-199039435| ~b$r_buff1_thd1~0_In-199039435)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-199039435| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-199039435, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-199039435, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-199039435, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-199039435} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-199039435, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-199039435, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-199039435, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-199039435, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-199039435|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:48:27,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:48:27,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:48:27,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-893870515 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In-893870515 256) 0))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-893870515 |ULTIMATE.start_main_#t~ite47_Out-893870515|)) (and (= ~b~0_In-893870515 |ULTIMATE.start_main_#t~ite47_Out-893870515|) (or .cse0 .cse1)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-893870515, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-893870515, ~b~0=~b~0_In-893870515, ~b$w_buff1~0=~b$w_buff1~0_In-893870515} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-893870515, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-893870515, ~b~0=~b~0_In-893870515, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-893870515|, ~b$w_buff1~0=~b$w_buff1~0_In-893870515} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:48:27,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:48:27,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In943081861 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In943081861 256) 0))) (or (and (= ~b$w_buff0_used~0_In943081861 |ULTIMATE.start_main_#t~ite49_Out943081861|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out943081861|) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In943081861, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In943081861} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In943081861, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out943081861|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In943081861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:48:27,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In-206261261 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In-206261261 256) 0)) (.cse3 (= (mod ~b$w_buff0_used~0_In-206261261 256) 0)) (.cse2 (= (mod ~b$r_buff0_thd0~0_In-206261261 256) 0))) (or (and (= ~b$w_buff1_used~0_In-206261261 |ULTIMATE.start_main_#t~ite50_Out-206261261|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-206261261|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-206261261, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-206261261, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-206261261, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-206261261} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-206261261|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-206261261, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-206261261, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-206261261, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-206261261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:48:27,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In203583452 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In203583452 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd0~0_In203583452 |ULTIMATE.start_main_#t~ite51_Out203583452|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out203583452|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In203583452, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In203583452} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In203583452, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out203583452|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In203583452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:48:27,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd0~0_In-170796629 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-170796629 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In-170796629 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In-170796629 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$r_buff1_thd0~0_In-170796629 |ULTIMATE.start_main_#t~ite52_Out-170796629|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-170796629| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-170796629, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-170796629, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-170796629, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-170796629} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-170796629, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-170796629|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-170796629, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-170796629, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-170796629} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:48:27,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:48:27,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:48:27 BasicIcfg [2019-12-27 16:48:27,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:48:27,908 INFO L168 Benchmark]: Toolchain (without parser) took 160360.65 ms. Allocated memory was 138.9 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:27,909 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:48:27,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.75 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 156.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:27,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.84 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:27,915 INFO L168 Benchmark]: Boogie Preprocessor took 45.60 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:27,919 INFO L168 Benchmark]: RCFGBuilder took 835.77 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.2 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:27,919 INFO L168 Benchmark]: TraceAbstraction took 158587.58 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:27,922 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.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.75 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 156.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.84 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.60 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.77 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.2 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 158587.58 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t861, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t862, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t863, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 158.2s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 71.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7968 SDtfs, 21524 SDslu, 37959 SDs, 0 SdLazy, 32029 SolverSat, 1252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1162 GetRequests, 289 SyntacticMatches, 85 SemanticMatches, 788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16662 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred 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: 42.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 314556 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1639 NumberOfCodeBlocks, 1639 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1540 ConstructedInterpolants, 0 QuantifiedInterpolants, 369286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...