/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/mix052_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:24:29,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:24:29,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:24:29,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:24:29,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:24:29,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:24:29,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:24:29,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:24:29,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:24:29,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:24:29,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:24:29,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:24:29,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:24:29,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:24:29,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:24:29,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:24:29,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:24:29,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:24:29,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:24:29,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:24:29,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:24:29,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:24:29,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:24:29,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:24:29,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:24:29,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:24:29,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:24:29,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:24:29,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:24:29,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:24:29,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:24:29,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:24:29,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:24:29,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:24:29,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:24:29,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:24:29,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:24:29,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:24:29,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:24:29,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:24:29,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:24:29,367 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 17:24:29,384 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:24:29,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:24:29,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:24:29,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:24:29,386 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:24:29,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:24:29,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:24:29,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:24:29,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:24:29,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:24:29,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:24:29,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:24:29,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:24:29,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:24:29,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:24:29,388 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:24:29,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:24:29,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:24:29,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:24:29,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:24:29,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:24:29,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:24:29,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:24:29,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:24:29,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:24:29,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:24:29,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:24:29,390 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:24:29,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:24:29,391 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:24:29,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:24:29,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:24:29,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:24:29,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:24:29,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:24:29,692 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:24:29,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-27 17:24:29,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5841f89c/56cea3f4dcc34abfbfb981304bcb5998/FLAG8abb7cb2b [2019-12-27 17:24:30,323 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:24:30,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-27 17:24:30,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5841f89c/56cea3f4dcc34abfbfb981304bcb5998/FLAG8abb7cb2b [2019-12-27 17:24:30,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5841f89c/56cea3f4dcc34abfbfb981304bcb5998 [2019-12-27 17:24:30,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:24:30,617 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:24:30,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:24:30,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:24:30,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:24:30,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:24:30" (1/1) ... [2019-12-27 17:24:30,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746c584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:30, skipping insertion in model container [2019-12-27 17:24:30,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:24:30" (1/1) ... [2019-12-27 17:24:30,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:24:30,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:24:31,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:24:31,211 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:24:31,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:24:31,391 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:24:31,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31 WrapperNode [2019-12-27 17:24:31,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:24:31,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:24:31,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:24:31,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:24:31,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:24:31,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:24:31,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:24:31,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:24:31,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (1/1) ... [2019-12-27 17:24:31,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:24:31,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:24:31,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:24:31,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:24:31,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (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 17:24:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:24:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:24:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:24:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:24:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:24:31,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:24:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:24:31,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:24:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:24:31,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:24:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:24:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:24:31,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:24:31,568 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 17:24:32,354 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:24:32,355 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:24:32,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:24:32 BoogieIcfgContainer [2019-12-27 17:24:32,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:24:32,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:24:32,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:24:32,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:24:32,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:24:30" (1/3) ... [2019-12-27 17:24:32,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299d5961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:24:32, skipping insertion in model container [2019-12-27 17:24:32,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:31" (2/3) ... [2019-12-27 17:24:32,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299d5961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:24:32, skipping insertion in model container [2019-12-27 17:24:32,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:24:32" (3/3) ... [2019-12-27 17:24:32,370 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.opt.i [2019-12-27 17:24:32,381 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:24:32,381 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:24:32,395 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:24:32,396 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:24:32,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,438 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,440 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,440 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,480 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,480 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,522 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,523 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,523 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,532 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:24:32,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:24:32,587 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:24:32,587 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:24:32,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:24:32,588 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:24:32,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:24:32,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:24:32,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:24:32,588 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:24:32,605 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 17:24:32,607 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 17:24:32,724 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 17:24:32,724 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:24:32,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:24:32,765 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 17:24:32,830 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 17:24:32,830 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:24:32,838 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:24:32,860 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:24:32,861 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:24:38,400 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 17:24:38,524 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 17:24:38,861 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 17:24:38,861 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 17:24:38,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 17:24:57,025 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 17:24:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 17:24:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:24:57,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:57,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:24:57,034 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 17:24:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:57,039 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 17:24:57,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:57,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479359470] [2019-12-27 17:24:57,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:57,242 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 17:24:57,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479359470] [2019-12-27 17:24:57,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:57,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:24:57,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087455231] [2019-12-27 17:24:57,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:57,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:57,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:24:57,263 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:57,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:57,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:24:57,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:57,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:24:57,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:57,286 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 17:25:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:01,126 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 17:25:01,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:25:01,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:25:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:01,720 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 17:25:01,720 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 17:25:01,722 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 17:25:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 17:25:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 17:25:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 17:25:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 17:25:08,660 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 17:25:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:08,660 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 17:25:08,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:25:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 17:25:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:25:08,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:08,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:25:08,665 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 17:25:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 17:25:08,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:08,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009450761] [2019-12-27 17:25:08,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:08,775 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 17:25:08,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009450761] [2019-12-27 17:25:08,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:08,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:25:08,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105151478] [2019-12-27 17:25:08,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:08,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:08,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:25:08,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:08,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:25:08,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:25:08,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:25:08,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:25:08,784 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 17:25:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:13,775 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 17:25:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:25:13,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:25:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:14,389 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 17:25:14,389 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 17:25:14,390 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 17:25:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 17:25:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 17:25:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 17:25:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 17:25:29,350 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 17:25:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:29,351 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 17:25:29,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:25:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 17:25:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:25:29,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:29,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:25:29,368 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 17:25:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 17:25:29,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:29,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390344739] [2019-12-27 17:25:29,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:29,476 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 17:25:29,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390344739] [2019-12-27 17:25:29,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:29,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:25:29,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2113820914] [2019-12-27 17:25:29,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:29,479 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:29,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:25:29,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:29,481 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:25:29,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:25:29,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:29,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:25:29,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:25:29,482 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 17:25:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:29,625 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 17:25:29,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:25:29,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:25:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:29,692 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 17:25:29,692 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 17:25:29,693 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 17:25:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 17:25:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 17:25:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 17:25:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 17:25:30,396 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 17:25:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:30,397 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 17:25:30,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:25:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 17:25:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:25:30,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:30,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:25:30,401 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 17:25:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 17:25:30,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:30,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992537730] [2019-12-27 17:25:30,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:30,535 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 17:25:30,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992537730] [2019-12-27 17:25:30,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:30,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:25:30,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798605241] [2019-12-27 17:25:30,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:30,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:30,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:25:30,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:30,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:25:30,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:25:30,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:30,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:25:30,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:25:30,549 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 17:25:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:31,035 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 17:25:31,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:25:31,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:25:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:31,119 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 17:25:31,119 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 17:25:31,120 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 17:25:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 17:25:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 17:25:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 17:25:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 17:25:33,172 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 17:25:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:33,173 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 17:25:33,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:25:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 17:25:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:25:33,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:33,183 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 17:25:33,183 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 17:25:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 17:25:33,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:33,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36709318] [2019-12-27 17:25:33,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:33,329 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 17:25:33,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36709318] [2019-12-27 17:25:33,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:33,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:25:33,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [888413686] [2019-12-27 17:25:33,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:33,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:33,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 17:25:33,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:33,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:25:33,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:25:33,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:25:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:25:33,345 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 17:25:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:34,283 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 17:25:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:25:34,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 17:25:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:34,374 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 17:25:34,375 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 17:25:34,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:25:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 17:25:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 17:25:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 17:25:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 17:25:37,466 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 17:25:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:37,467 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 17:25:37,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:25:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 17:25:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:25:37,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:37,482 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 17:25:37,482 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 17:25:37,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:37,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 17:25:37,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:37,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208088587] [2019-12-27 17:25:37,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:37,540 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 17:25:37,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208088587] [2019-12-27 17:25:37,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:37,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:25:37,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333218813] [2019-12-27 17:25:37,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:37,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:37,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:25:37,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:37,595 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:25:37,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:25:37,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:25:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:25:37,597 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 5 states. [2019-12-27 17:25:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:37,698 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 17:25:37,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:25:37,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:25:37,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:37,727 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 17:25:37,727 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 17:25:37,728 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 17:25:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 17:25:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 17:25:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 17:25:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 17:25:37,963 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 17:25:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:37,963 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 17:25:37,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:25:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 17:25:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:25:37,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:37,974 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 17:25:37,975 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 17:25:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 17:25:37,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:37,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642814859] [2019-12-27 17:25:37,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:38,081 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 17:25:38,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642814859] [2019-12-27 17:25:38,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:38,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:25:38,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1540681748] [2019-12-27 17:25:38,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:38,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:38,093 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:25:38,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:38,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:25:38,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:25:38,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:25:38,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:25:38,095 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 17:25:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:38,647 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 17:25:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:25:38,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:25:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:38,677 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 17:25:38,677 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 17:25:38,678 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 17:25:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 17:25:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 17:25:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 17:25:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 17:25:39,274 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 17:25:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:39,274 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 17:25:39,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:25:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 17:25:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:25:39,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:39,291 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 17:25:39,292 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 17:25:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 17:25:39,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:39,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738906334] [2019-12-27 17:25:39,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:39,457 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 17:25:39,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738906334] [2019-12-27 17:25:39,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:39,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:25:39,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751638841] [2019-12-27 17:25:39,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:39,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:39,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 17:25:39,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:39,482 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:25:39,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:25:39,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:25:39,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:25:39,483 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 8 states. [2019-12-27 17:25:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:40,739 INFO L93 Difference]: Finished difference Result 24561 states and 72020 transitions. [2019-12-27 17:25:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:25:40,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 17:25:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:40,772 INFO L225 Difference]: With dead ends: 24561 [2019-12-27 17:25:40,773 INFO L226 Difference]: Without dead ends: 24561 [2019-12-27 17:25:40,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:25:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2019-12-27 17:25:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 17437. [2019-12-27 17:25:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2019-12-27 17:25:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 52503 transitions. [2019-12-27 17:25:41,076 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 52503 transitions. Word has length 33 [2019-12-27 17:25:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:41,076 INFO L462 AbstractCegarLoop]: Abstraction has 17437 states and 52503 transitions. [2019-12-27 17:25:41,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:25:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 52503 transitions. [2019-12-27 17:25:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:25:41,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:41,095 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 17:25:41,095 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 17:25:41,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash -147828206, now seen corresponding path program 2 times [2019-12-27 17:25:41,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:41,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763941715] [2019-12-27 17:25:41,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:41,184 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 17:25:41,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763941715] [2019-12-27 17:25:41,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:41,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:25:41,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1620753299] [2019-12-27 17:25:41,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:41,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:41,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 85 transitions. [2019-12-27 17:25:41,209 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:41,209 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:25:41,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:25:41,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:41,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:25:41,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:25:41,210 INFO L87 Difference]: Start difference. First operand 17437 states and 52503 transitions. Second operand 7 states. [2019-12-27 17:25:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:42,399 INFO L93 Difference]: Finished difference Result 24299 states and 71228 transitions. [2019-12-27 17:25:42,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:25:42,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 17:25:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:42,432 INFO L225 Difference]: With dead ends: 24299 [2019-12-27 17:25:42,432 INFO L226 Difference]: Without dead ends: 24299 [2019-12-27 17:25:42,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:25:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24299 states. [2019-12-27 17:25:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24299 to 16666. [2019-12-27 17:25:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 17:25:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 17:25:42,719 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 17:25:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:42,719 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 17:25:42,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:25:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 17:25:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:25:42,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:42,739 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 17:25:42,739 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 17:25:42,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:42,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 17:25:42,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:42,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600249041] [2019-12-27 17:25:42,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:43,026 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 17:25:43,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600249041] [2019-12-27 17:25:43,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:43,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:25:43,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880583559] [2019-12-27 17:25:43,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:43,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:43,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 17:25:43,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:43,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:25:43,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:25:43,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:25:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:25:43,195 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 8 states. [2019-12-27 17:25:43,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:43,335 INFO L93 Difference]: Finished difference Result 15541 states and 47563 transitions. [2019-12-27 17:25:43,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:25:43,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 17:25:43,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:43,366 INFO L225 Difference]: With dead ends: 15541 [2019-12-27 17:25:43,366 INFO L226 Difference]: Without dead ends: 15541 [2019-12-27 17:25:43,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:25:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15541 states. [2019-12-27 17:25:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15541 to 15044. [2019-12-27 17:25:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15044 states. [2019-12-27 17:25:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15044 states to 15044 states and 46220 transitions. [2019-12-27 17:25:43,710 INFO L78 Accepts]: Start accepts. Automaton has 15044 states and 46220 transitions. Word has length 39 [2019-12-27 17:25:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:43,710 INFO L462 AbstractCegarLoop]: Abstraction has 15044 states and 46220 transitions. [2019-12-27 17:25:43,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:25:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 15044 states and 46220 transitions. [2019-12-27 17:25:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:25:43,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:43,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:25:43,743 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 17:25:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-27 17:25:43,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:43,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818717818] [2019-12-27 17:25:43,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:43,842 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 17:25:43,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818717818] [2019-12-27 17:25:43,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:43,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:25:43,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448492125] [2019-12-27 17:25:43,843 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:43,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:44,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 17:25:44,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:44,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:25:44,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:25:44,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:25:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:25:44,172 INFO L87 Difference]: Start difference. First operand 15044 states and 46220 transitions. Second operand 3 states. [2019-12-27 17:25:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:44,282 INFO L93 Difference]: Finished difference Result 22609 states and 69550 transitions. [2019-12-27 17:25:44,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:25:44,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:25:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:44,315 INFO L225 Difference]: With dead ends: 22609 [2019-12-27 17:25:44,315 INFO L226 Difference]: Without dead ends: 22609 [2019-12-27 17:25:44,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 17:25:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22609 states. [2019-12-27 17:25:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22609 to 16710. [2019-12-27 17:25:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-27 17:25:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 52163 transitions. [2019-12-27 17:25:44,611 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 52163 transitions. Word has length 64 [2019-12-27 17:25:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:44,611 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 52163 transitions. [2019-12-27 17:25:44,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:25:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 52163 transitions. [2019-12-27 17:25:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:25:44,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:44,709 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 17:25:44,709 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 17:25:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:44,710 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-27 17:25:44,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:44,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146337840] [2019-12-27 17:25:44,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:44,809 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 17:25:44,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146337840] [2019-12-27 17:25:44,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:44,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:25:44,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720061155] [2019-12-27 17:25:44,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:44,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:45,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 17:25:45,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:45,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:25:45,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 17:25:45,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:25:45,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:25:45,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:25:45,346 INFO L87 Difference]: Start difference. First operand 16710 states and 52163 transitions. Second operand 8 states. [2019-12-27 17:25:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:46,369 INFO L93 Difference]: Finished difference Result 50915 states and 162662 transitions. [2019-12-27 17:25:46,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:25:46,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 17:25:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:46,422 INFO L225 Difference]: With dead ends: 50915 [2019-12-27 17:25:46,422 INFO L226 Difference]: Without dead ends: 34033 [2019-12-27 17:25:46,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:25:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34033 states. [2019-12-27 17:25:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34033 to 18779. [2019-12-27 17:25:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18779 states. [2019-12-27 17:25:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 60016 transitions. [2019-12-27 17:25:46,806 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 60016 transitions. Word has length 64 [2019-12-27 17:25:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:46,807 INFO L462 AbstractCegarLoop]: Abstraction has 18779 states and 60016 transitions. [2019-12-27 17:25:46,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:25:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 60016 transitions. [2019-12-27 17:25:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:25:46,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:46,827 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 17:25:46,828 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 17:25:46,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1236003369, now seen corresponding path program 2 times [2019-12-27 17:25:46,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:46,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636598366] [2019-12-27 17:25:46,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:46,932 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 17:25:46,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636598366] [2019-12-27 17:25:46,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:46,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:25:46,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591134883] [2019-12-27 17:25:46,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:46,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:47,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 417 transitions. [2019-12-27 17:25:47,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:47,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:25:47,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:25:47,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:47,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:25:47,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:25:47,463 INFO L87 Difference]: Start difference. First operand 18779 states and 60016 transitions. Second operand 11 states. [2019-12-27 17:25:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:48,343 INFO L93 Difference]: Finished difference Result 53381 states and 167115 transitions. [2019-12-27 17:25:48,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:25:48,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:25:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:48,399 INFO L225 Difference]: With dead ends: 53381 [2019-12-27 17:25:48,400 INFO L226 Difference]: Without dead ends: 37717 [2019-12-27 17:25:48,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:25:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37717 states. [2019-12-27 17:25:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37717 to 21919. [2019-12-27 17:25:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21919 states. [2019-12-27 17:25:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21919 states to 21919 states and 70045 transitions. [2019-12-27 17:25:48,874 INFO L78 Accepts]: Start accepts. Automaton has 21919 states and 70045 transitions. Word has length 64 [2019-12-27 17:25:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:48,874 INFO L462 AbstractCegarLoop]: Abstraction has 21919 states and 70045 transitions. [2019-12-27 17:25:48,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:25:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 21919 states and 70045 transitions. [2019-12-27 17:25:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:25:48,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:48,910 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 17:25:48,910 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 17:25:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-27 17:25:48,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:48,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662816873] [2019-12-27 17:25:48,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:49,007 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 17:25:49,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662816873] [2019-12-27 17:25:49,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:49,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:25:49,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385678966] [2019-12-27 17:25:49,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:49,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:49,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 17:25:49,308 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:49,445 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 17:25:49,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:25:49,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:25:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:25:49,446 INFO L87 Difference]: Start difference. First operand 21919 states and 70045 transitions. Second operand 10 states. [2019-12-27 17:25:49,696 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 17:25:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:51,260 INFO L93 Difference]: Finished difference Result 103716 states and 322048 transitions. [2019-12-27 17:25:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 17:25:51,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:25:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:51,404 INFO L225 Difference]: With dead ends: 103716 [2019-12-27 17:25:51,405 INFO L226 Difference]: Without dead ends: 81539 [2019-12-27 17:25:51,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 17:25:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81539 states. [2019-12-27 17:25:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81539 to 25970. [2019-12-27 17:25:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25970 states. [2019-12-27 17:25:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25970 states to 25970 states and 83157 transitions. [2019-12-27 17:25:52,249 INFO L78 Accepts]: Start accepts. Automaton has 25970 states and 83157 transitions. Word has length 64 [2019-12-27 17:25:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:52,250 INFO L462 AbstractCegarLoop]: Abstraction has 25970 states and 83157 transitions. [2019-12-27 17:25:52,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:25:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 25970 states and 83157 transitions. [2019-12-27 17:25:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:25:52,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:52,280 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 17:25:52,280 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 17:25:52,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1026171661, now seen corresponding path program 4 times [2019-12-27 17:25:52,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:52,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718586531] [2019-12-27 17:25:52,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:52,376 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 17:25:52,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718586531] [2019-12-27 17:25:52,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:52,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:25:52,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [924413500] [2019-12-27 17:25:52,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:52,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:52,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 633 transitions. [2019-12-27 17:25:52,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:52,932 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 17:25:52,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:25:52,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:25:52,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:25:52,934 INFO L87 Difference]: Start difference. First operand 25970 states and 83157 transitions. Second operand 9 states. [2019-12-27 17:25:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:53,658 INFO L93 Difference]: Finished difference Result 52770 states and 166583 transitions. [2019-12-27 17:25:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:25:53,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 17:25:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:53,731 INFO L225 Difference]: With dead ends: 52770 [2019-12-27 17:25:53,731 INFO L226 Difference]: Without dead ends: 46964 [2019-12-27 17:25:53,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:25:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46964 states. [2019-12-27 17:25:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46964 to 26375. [2019-12-27 17:25:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26375 states. [2019-12-27 17:25:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26375 states to 26375 states and 84524 transitions. [2019-12-27 17:25:54,294 INFO L78 Accepts]: Start accepts. Automaton has 26375 states and 84524 transitions. Word has length 64 [2019-12-27 17:25:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:54,294 INFO L462 AbstractCegarLoop]: Abstraction has 26375 states and 84524 transitions. [2019-12-27 17:25:54,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:25:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 26375 states and 84524 transitions. [2019-12-27 17:25:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:25:54,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:54,326 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 17:25:54,326 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 17:25:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1357359899, now seen corresponding path program 5 times [2019-12-27 17:25:54,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:54,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990179605] [2019-12-27 17:25:54,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:54,417 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 17:25:54,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990179605] [2019-12-27 17:25:54,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:54,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:25:54,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108493920] [2019-12-27 17:25:54,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:54,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:54,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 354 transitions. [2019-12-27 17:25:54,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:54,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:25:54,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:25:54,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:54,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:25:54,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:25:54,673 INFO L87 Difference]: Start difference. First operand 26375 states and 84524 transitions. Second operand 5 states. [2019-12-27 17:25:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:55,020 INFO L93 Difference]: Finished difference Result 28211 states and 89657 transitions. [2019-12-27 17:25:55,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:25:55,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 17:25:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:25:55,229 INFO L225 Difference]: With dead ends: 28211 [2019-12-27 17:25:55,229 INFO L226 Difference]: Without dead ends: 28211 [2019-12-27 17:25:55,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:25:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28211 states. [2019-12-27 17:25:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28211 to 26700. [2019-12-27 17:25:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26700 states. [2019-12-27 17:25:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26700 states to 26700 states and 85526 transitions. [2019-12-27 17:25:55,657 INFO L78 Accepts]: Start accepts. Automaton has 26700 states and 85526 transitions. Word has length 64 [2019-12-27 17:25:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:25:55,657 INFO L462 AbstractCegarLoop]: Abstraction has 26700 states and 85526 transitions. [2019-12-27 17:25:55,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:25:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 26700 states and 85526 transitions. [2019-12-27 17:25:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:25:55,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:25:55,690 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 17:25:55,690 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 17:25:55,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:25:55,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2005415299, now seen corresponding path program 6 times [2019-12-27 17:25:55,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:25:55,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648141475] [2019-12-27 17:25:55,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:25:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:25:55,787 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 17:25:55,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648141475] [2019-12-27 17:25:55,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:25:55,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:25:55,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316386736] [2019-12-27 17:25:55,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:25:55,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:25:56,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 287 states and 568 transitions. [2019-12-27 17:25:56,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:25:56,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 17:25:56,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:25:56,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:25:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:25:56,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:25:56,244 INFO L87 Difference]: Start difference. First operand 26700 states and 85526 transitions. Second operand 11 states. [2019-12-27 17:25:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:25:59,949 INFO L93 Difference]: Finished difference Result 90493 states and 283626 transitions. [2019-12-27 17:25:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 17:25:59,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:25:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:00,091 INFO L225 Difference]: With dead ends: 90493 [2019-12-27 17:26:00,091 INFO L226 Difference]: Without dead ends: 90325 [2019-12-27 17:26:00,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=421, Invalid=1061, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 17:26:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90325 states. [2019-12-27 17:26:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90325 to 35687. [2019-12-27 17:26:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35687 states. [2019-12-27 17:26:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35687 states to 35687 states and 113864 transitions. [2019-12-27 17:26:01,074 INFO L78 Accepts]: Start accepts. Automaton has 35687 states and 113864 transitions. Word has length 64 [2019-12-27 17:26:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:01,074 INFO L462 AbstractCegarLoop]: Abstraction has 35687 states and 113864 transitions. [2019-12-27 17:26:01,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:26:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 35687 states and 113864 transitions. [2019-12-27 17:26:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:26:01,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:01,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:26:01,115 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 17:26:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash -217470995, now seen corresponding path program 7 times [2019-12-27 17:26:01,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:01,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257665890] [2019-12-27 17:26:01,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:01,226 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 17:26:01,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257665890] [2019-12-27 17:26:01,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:01,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:26:01,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1929418101] [2019-12-27 17:26:01,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:01,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:01,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 501 transitions. [2019-12-27 17:26:01,466 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:01,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:26:01,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:26:01,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:01,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:26:01,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:26:01,467 INFO L87 Difference]: Start difference. First operand 35687 states and 113864 transitions. Second operand 3 states. [2019-12-27 17:26:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:01,794 INFO L93 Difference]: Finished difference Result 35687 states and 113863 transitions. [2019-12-27 17:26:01,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:26:01,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:26:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:01,852 INFO L225 Difference]: With dead ends: 35687 [2019-12-27 17:26:01,853 INFO L226 Difference]: Without dead ends: 35687 [2019-12-27 17:26:01,853 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 17:26:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35687 states. [2019-12-27 17:26:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35687 to 30249. [2019-12-27 17:26:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30249 states. [2019-12-27 17:26:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30249 states to 30249 states and 97183 transitions. [2019-12-27 17:26:02,374 INFO L78 Accepts]: Start accepts. Automaton has 30249 states and 97183 transitions. Word has length 64 [2019-12-27 17:26:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:02,374 INFO L462 AbstractCegarLoop]: Abstraction has 30249 states and 97183 transitions. [2019-12-27 17:26:02,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:26:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 30249 states and 97183 transitions. [2019-12-27 17:26:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:26:02,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:02,413 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 17:26:02,413 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 17:26:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash 382950881, now seen corresponding path program 1 times [2019-12-27 17:26:02,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:02,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892910058] [2019-12-27 17:26:02,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:02,564 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 17:26:02,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892910058] [2019-12-27 17:26:02,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:02,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:26:02,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [413876487] [2019-12-27 17:26:02,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:02,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:02,963 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 290 states and 550 transitions. [2019-12-27 17:26:02,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:03,155 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 17:26:03,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:26:03,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:03,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:26:03,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:26:03,156 INFO L87 Difference]: Start difference. First operand 30249 states and 97183 transitions. Second operand 15 states. [2019-12-27 17:26:06,100 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-12-27 17:26:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:09,033 INFO L93 Difference]: Finished difference Result 79631 states and 247028 transitions. [2019-12-27 17:26:09,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 17:26:09,034 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-27 17:26:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:09,159 INFO L225 Difference]: With dead ends: 79631 [2019-12-27 17:26:09,160 INFO L226 Difference]: Without dead ends: 79282 [2019-12-27 17:26:09,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=640, Invalid=3020, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 17:26:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79282 states. [2019-12-27 17:26:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79282 to 38454. [2019-12-27 17:26:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38454 states. [2019-12-27 17:26:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38454 states to 38454 states and 121907 transitions. [2019-12-27 17:26:10,145 INFO L78 Accepts]: Start accepts. Automaton has 38454 states and 121907 transitions. Word has length 65 [2019-12-27 17:26:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:10,145 INFO L462 AbstractCegarLoop]: Abstraction has 38454 states and 121907 transitions. [2019-12-27 17:26:10,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:26:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 38454 states and 121907 transitions. [2019-12-27 17:26:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:26:10,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:10,195 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 17:26:10,195 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 17:26:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1933214985, now seen corresponding path program 2 times [2019-12-27 17:26:10,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:10,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323397592] [2019-12-27 17:26:10,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:10,281 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 17:26:10,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323397592] [2019-12-27 17:26:10,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:10,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:26:10,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [923180222] [2019-12-27 17:26:10,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:10,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:10,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 324 transitions. [2019-12-27 17:26:10,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:10,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:26:11,216 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 17:26:11,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:26:11,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:11,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:26:11,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:26:11,217 INFO L87 Difference]: Start difference. First operand 38454 states and 121907 transitions. Second operand 19 states. [2019-12-27 17:26:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:19,148 INFO L93 Difference]: Finished difference Result 101548 states and 311109 transitions. [2019-12-27 17:26:19,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-27 17:26:19,149 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-12-27 17:26:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:19,314 INFO L225 Difference]: With dead ends: 101548 [2019-12-27 17:26:19,314 INFO L226 Difference]: Without dead ends: 101252 [2019-12-27 17:26:19,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2308, Invalid=8404, Unknown=0, NotChecked=0, Total=10712 [2019-12-27 17:26:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101252 states. [2019-12-27 17:26:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101252 to 43704. [2019-12-27 17:26:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43704 states. [2019-12-27 17:26:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43704 states to 43704 states and 139486 transitions. [2019-12-27 17:26:20,883 INFO L78 Accepts]: Start accepts. Automaton has 43704 states and 139486 transitions. Word has length 65 [2019-12-27 17:26:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:20,884 INFO L462 AbstractCegarLoop]: Abstraction has 43704 states and 139486 transitions. [2019-12-27 17:26:20,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:26:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 43704 states and 139486 transitions. [2019-12-27 17:26:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:26:20,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:20,936 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 17:26:20,937 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 17:26:20,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:20,937 INFO L82 PathProgramCache]: Analyzing trace with hash 557633855, now seen corresponding path program 3 times [2019-12-27 17:26:20,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:20,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232627517] [2019-12-27 17:26:20,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:21,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 17:26:21,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232627517] [2019-12-27 17:26:21,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:21,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:26:21,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113681516] [2019-12-27 17:26:21,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:21,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:21,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 246 transitions. [2019-12-27 17:26:21,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:21,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:26:21,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:26:21,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:21,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:26:21,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:26:21,270 INFO L87 Difference]: Start difference. First operand 43704 states and 139486 transitions. Second operand 11 states. [2019-12-27 17:26:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:23,382 INFO L93 Difference]: Finished difference Result 63084 states and 197038 transitions. [2019-12-27 17:26:23,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 17:26:23,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 17:26:23,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:23,485 INFO L225 Difference]: With dead ends: 63084 [2019-12-27 17:26:23,486 INFO L226 Difference]: Without dead ends: 62832 [2019-12-27 17:26:23,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2019-12-27 17:26:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62832 states. [2019-12-27 17:26:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62832 to 42909. [2019-12-27 17:26:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42909 states. [2019-12-27 17:26:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42909 states to 42909 states and 137042 transitions. [2019-12-27 17:26:24,602 INFO L78 Accepts]: Start accepts. Automaton has 42909 states and 137042 transitions. Word has length 65 [2019-12-27 17:26:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:24,602 INFO L462 AbstractCegarLoop]: Abstraction has 42909 states and 137042 transitions. [2019-12-27 17:26:24,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:26:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 42909 states and 137042 transitions. [2019-12-27 17:26:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:26:24,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:24,657 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 17:26:24,657 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 17:26:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2105060597, now seen corresponding path program 4 times [2019-12-27 17:26:24,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:24,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284125046] [2019-12-27 17:26:24,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:24,729 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 17:26:24,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284125046] [2019-12-27 17:26:24,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:24,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:26:24,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [384431404] [2019-12-27 17:26:24,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:24,750 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:24,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 235 transitions. [2019-12-27 17:26:24,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:24,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:26:24,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:26:24,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:24,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:26:24,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:26:24,967 INFO L87 Difference]: Start difference. First operand 42909 states and 137042 transitions. Second operand 4 states. [2019-12-27 17:26:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:25,324 INFO L93 Difference]: Finished difference Result 36156 states and 112910 transitions. [2019-12-27 17:26:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:26:25,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 17:26:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:25,378 INFO L225 Difference]: With dead ends: 36156 [2019-12-27 17:26:25,378 INFO L226 Difference]: Without dead ends: 36156 [2019-12-27 17:26:25,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 17:26:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36156 states. [2019-12-27 17:26:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36156 to 33340. [2019-12-27 17:26:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33340 states. [2019-12-27 17:26:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33340 states to 33340 states and 104570 transitions. [2019-12-27 17:26:25,921 INFO L78 Accepts]: Start accepts. Automaton has 33340 states and 104570 transitions. Word has length 65 [2019-12-27 17:26:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:25,921 INFO L462 AbstractCegarLoop]: Abstraction has 33340 states and 104570 transitions. [2019-12-27 17:26:25,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:26:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 33340 states and 104570 transitions. [2019-12-27 17:26:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:26:25,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:25,966 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 17:26:25,967 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 17:26:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1860630415, now seen corresponding path program 1 times [2019-12-27 17:26:25,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:25,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708034801] [2019-12-27 17:26:25,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:26,072 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 17:26:26,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708034801] [2019-12-27 17:26:26,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:26,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:26:26,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1090497185] [2019-12-27 17:26:26,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:26,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:26,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 332 states and 685 transitions. [2019-12-27 17:26:26,677 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:26:27,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 17:26:27,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:26:27,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:27,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:26:27,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:26:27,143 INFO L87 Difference]: Start difference. First operand 33340 states and 104570 transitions. Second operand 16 states. [2019-12-27 17:26:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:30,565 INFO L93 Difference]: Finished difference Result 49143 states and 149825 transitions. [2019-12-27 17:26:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 17:26:30,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 17:26:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:30,638 INFO L225 Difference]: With dead ends: 49143 [2019-12-27 17:26:30,638 INFO L226 Difference]: Without dead ends: 49143 [2019-12-27 17:26:30,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=1413, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 17:26:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49143 states. [2019-12-27 17:26:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49143 to 32243. [2019-12-27 17:26:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32243 states. [2019-12-27 17:26:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32243 states to 32243 states and 101123 transitions. [2019-12-27 17:26:31,276 INFO L78 Accepts]: Start accepts. Automaton has 32243 states and 101123 transitions. Word has length 66 [2019-12-27 17:26:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:31,277 INFO L462 AbstractCegarLoop]: Abstraction has 32243 states and 101123 transitions. [2019-12-27 17:26:31,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:26:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 32243 states and 101123 transitions. [2019-12-27 17:26:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:26:31,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:31,314 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 17:26:31,314 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 17:26:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1036503919, now seen corresponding path program 2 times [2019-12-27 17:26:31,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:31,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952749674] [2019-12-27 17:26:31,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:31,433 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 17:26:31,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952749674] [2019-12-27 17:26:31,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:31,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:26:31,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643229102] [2019-12-27 17:26:31,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:31,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:31,717 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 410 transitions. [2019-12-27 17:26:31,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:31,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:26:32,057 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 17:26:32,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:26:32,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:26:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:26:32,058 INFO L87 Difference]: Start difference. First operand 32243 states and 101123 transitions. Second operand 15 states. [2019-12-27 17:26:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:34,356 INFO L93 Difference]: Finished difference Result 55250 states and 171375 transitions. [2019-12-27 17:26:34,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:26:34,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 17:26:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:34,421 INFO L225 Difference]: With dead ends: 55250 [2019-12-27 17:26:34,421 INFO L226 Difference]: Without dead ends: 43004 [2019-12-27 17:26:34,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:26:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43004 states. [2019-12-27 17:26:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43004 to 32969. [2019-12-27 17:26:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32969 states. [2019-12-27 17:26:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32969 states to 32969 states and 102568 transitions. [2019-12-27 17:26:35,008 INFO L78 Accepts]: Start accepts. Automaton has 32969 states and 102568 transitions. Word has length 66 [2019-12-27 17:26:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:35,008 INFO L462 AbstractCegarLoop]: Abstraction has 32969 states and 102568 transitions. [2019-12-27 17:26:35,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:26:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 32969 states and 102568 transitions. [2019-12-27 17:26:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:26:35,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:35,045 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 17:26:35,046 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 17:26:35,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:35,046 INFO L82 PathProgramCache]: Analyzing trace with hash -128449455, now seen corresponding path program 3 times [2019-12-27 17:26:35,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:35,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900094184] [2019-12-27 17:26:35,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:35,223 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 17:26:35,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900094184] [2019-12-27 17:26:35,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:35,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:26:35,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1789875090] [2019-12-27 17:26:35,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:35,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:35,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 420 transitions. [2019-12-27 17:26:35,414 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:35,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:26:35,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:26:35,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:26:35,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:26:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:26:35,868 INFO L87 Difference]: Start difference. First operand 32969 states and 102568 transitions. Second operand 17 states. [2019-12-27 17:26:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:38,581 INFO L93 Difference]: Finished difference Result 61275 states and 190349 transitions. [2019-12-27 17:26:38,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 17:26:38,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 17:26:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:38,956 INFO L225 Difference]: With dead ends: 61275 [2019-12-27 17:26:38,956 INFO L226 Difference]: Without dead ends: 58579 [2019-12-27 17:26:38,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 17:26:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58579 states. [2019-12-27 17:26:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58579 to 36549. [2019-12-27 17:26:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36549 states. [2019-12-27 17:26:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36549 states to 36549 states and 113297 transitions. [2019-12-27 17:26:39,644 INFO L78 Accepts]: Start accepts. Automaton has 36549 states and 113297 transitions. Word has length 66 [2019-12-27 17:26:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:39,644 INFO L462 AbstractCegarLoop]: Abstraction has 36549 states and 113297 transitions. [2019-12-27 17:26:39,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:26:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 36549 states and 113297 transitions. [2019-12-27 17:26:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:26:39,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:39,686 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 17:26:39,686 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 17:26:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash 634786091, now seen corresponding path program 4 times [2019-12-27 17:26:39,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:39,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295744881] [2019-12-27 17:26:39,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:39,867 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 17:26:39,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295744881] [2019-12-27 17:26:39,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:39,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:26:39,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342937472] [2019-12-27 17:26:39,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:39,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:40,056 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 456 transitions. [2019-12-27 17:26:40,056 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:40,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:26:40,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:26:40,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:26:40,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:40,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:26:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:26:40,420 INFO L87 Difference]: Start difference. First operand 36549 states and 113297 transitions. Second operand 18 states. [2019-12-27 17:26:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:44,266 INFO L93 Difference]: Finished difference Result 71735 states and 221250 transitions. [2019-12-27 17:26:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 17:26:44,267 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 17:26:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:44,367 INFO L225 Difference]: With dead ends: 71735 [2019-12-27 17:26:44,368 INFO L226 Difference]: Without dead ends: 63114 [2019-12-27 17:26:44,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1472, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 17:26:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63114 states. [2019-12-27 17:26:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63114 to 31633. [2019-12-27 17:26:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31633 states. [2019-12-27 17:26:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31633 states to 31633 states and 98377 transitions. [2019-12-27 17:26:45,341 INFO L78 Accepts]: Start accepts. Automaton has 31633 states and 98377 transitions. Word has length 66 [2019-12-27 17:26:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:45,341 INFO L462 AbstractCegarLoop]: Abstraction has 31633 states and 98377 transitions. [2019-12-27 17:26:45,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:26:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 31633 states and 98377 transitions. [2019-12-27 17:26:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:26:45,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:45,383 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 17:26:45,383 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 17:26:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash -821584657, now seen corresponding path program 5 times [2019-12-27 17:26:45,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:45,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27051710] [2019-12-27 17:26:45,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:45,476 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 17:26:45,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27051710] [2019-12-27 17:26:45,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:45,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:26:45,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68766695] [2019-12-27 17:26:45,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:45,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:45,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 383 transitions. [2019-12-27 17:26:45,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:45,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:26:45,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:26:45,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:26:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:26:45,717 INFO L87 Difference]: Start difference. First operand 31633 states and 98377 transitions. Second operand 4 states. [2019-12-27 17:26:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:45,878 INFO L93 Difference]: Finished difference Result 36156 states and 112103 transitions. [2019-12-27 17:26:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:26:45,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 17:26:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:45,930 INFO L225 Difference]: With dead ends: 36156 [2019-12-27 17:26:45,930 INFO L226 Difference]: Without dead ends: 36156 [2019-12-27 17:26:45,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:26:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36156 states. [2019-12-27 17:26:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36156 to 26442. [2019-12-27 17:26:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26442 states. [2019-12-27 17:26:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26442 states to 26442 states and 81170 transitions. [2019-12-27 17:26:46,418 INFO L78 Accepts]: Start accepts. Automaton has 26442 states and 81170 transitions. Word has length 66 [2019-12-27 17:26:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:46,418 INFO L462 AbstractCegarLoop]: Abstraction has 26442 states and 81170 transitions. [2019-12-27 17:26:46,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:26:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26442 states and 81170 transitions. [2019-12-27 17:26:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:26:46,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:46,449 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 17:26:46,449 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 17:26:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 1 times [2019-12-27 17:26:46,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:46,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775098698] [2019-12-27 17:26:46,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:46,666 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 17:26:46,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775098698] [2019-12-27 17:26:46,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:46,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:26:46,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729850533] [2019-12-27 17:26:46,667 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:46,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:47,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 17:26:47,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:47,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:26:47,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 17:26:47,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:26:47,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:47,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:26:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:26:47,786 INFO L87 Difference]: Start difference. First operand 26442 states and 81170 transitions. Second operand 18 states. [2019-12-27 17:26:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:26:49,445 INFO L93 Difference]: Finished difference Result 44547 states and 136952 transitions. [2019-12-27 17:26:49,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:26:49,445 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 17:26:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:26:49,512 INFO L225 Difference]: With dead ends: 44547 [2019-12-27 17:26:49,512 INFO L226 Difference]: Without dead ends: 44118 [2019-12-27 17:26:49,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 17:26:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44118 states. [2019-12-27 17:26:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44118 to 26188. [2019-12-27 17:26:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26188 states. [2019-12-27 17:26:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26188 states to 26188 states and 80526 transitions. [2019-12-27 17:26:50,036 INFO L78 Accepts]: Start accepts. Automaton has 26188 states and 80526 transitions. Word has length 67 [2019-12-27 17:26:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:26:50,036 INFO L462 AbstractCegarLoop]: Abstraction has 26188 states and 80526 transitions. [2019-12-27 17:26:50,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:26:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 26188 states and 80526 transitions. [2019-12-27 17:26:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:26:50,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:26:50,063 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 17:26:50,063 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 17:26:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:26:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1791716501, now seen corresponding path program 1 times [2019-12-27 17:26:50,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:26:50,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620028713] [2019-12-27 17:26:50,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:26:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:26:50,270 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 17:26:50,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620028713] [2019-12-27 17:26:50,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:26:50,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:26:50,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [36347808] [2019-12-27 17:26:50,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:26:50,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:26:50,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 344 transitions. [2019-12-27 17:26:50,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:26:50,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:26:50,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:26:51,113 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 17:26:51,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 17:26:51,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:26:51,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 17:26:51,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:26:51,115 INFO L87 Difference]: Start difference. First operand 26188 states and 80526 transitions. Second operand 24 states. [2019-12-27 17:26:54,584 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 17:26:55,722 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 17:26:59,042 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-27 17:27:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:03,448 INFO L93 Difference]: Finished difference Result 90038 states and 271254 transitions. [2019-12-27 17:27:03,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-12-27 17:27:03,448 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 17:27:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:03,578 INFO L225 Difference]: With dead ends: 90038 [2019-12-27 17:27:03,578 INFO L226 Difference]: Without dead ends: 89990 [2019-12-27 17:27:03,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4498 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2247, Invalid=9743, Unknown=0, NotChecked=0, Total=11990 [2019-12-27 17:27:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89990 states. [2019-12-27 17:27:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89990 to 29438. [2019-12-27 17:27:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29438 states. [2019-12-27 17:27:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29438 states to 29438 states and 89788 transitions. [2019-12-27 17:27:04,928 INFO L78 Accepts]: Start accepts. Automaton has 29438 states and 89788 transitions. Word has length 67 [2019-12-27 17:27:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:04,928 INFO L462 AbstractCegarLoop]: Abstraction has 29438 states and 89788 transitions. [2019-12-27 17:27:04,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 17:27:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 29438 states and 89788 transitions. [2019-12-27 17:27:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:27:04,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:04,960 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 17:27:04,961 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 17:27:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686927, now seen corresponding path program 1 times [2019-12-27 17:27:04,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:04,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428727021] [2019-12-27 17:27:04,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:05,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 17:27:05,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428727021] [2019-12-27 17:27:05,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:05,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:27:05,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205613664] [2019-12-27 17:27:05,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:05,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:05,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 557 transitions. [2019-12-27 17:27:05,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:05,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:27:05,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 17:27:05,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 17:27:05,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:05,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 17:27:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:27:05,807 INFO L87 Difference]: Start difference. First operand 29438 states and 89788 transitions. Second operand 23 states. [2019-12-27 17:27:14,348 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-27 17:27:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:18,418 INFO L93 Difference]: Finished difference Result 113292 states and 343398 transitions. [2019-12-27 17:27:18,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-12-27 17:27:18,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-27 17:27:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:18,586 INFO L225 Difference]: With dead ends: 113292 [2019-12-27 17:27:18,586 INFO L226 Difference]: Without dead ends: 113292 [2019-12-27 17:27:18,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9155 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3864, Invalid=18486, Unknown=0, NotChecked=0, Total=22350 [2019-12-27 17:27:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113292 states. [2019-12-27 17:27:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113292 to 32345. [2019-12-27 17:27:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32345 states. [2019-12-27 17:27:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32345 states to 32345 states and 99497 transitions. [2019-12-27 17:27:19,804 INFO L78 Accepts]: Start accepts. Automaton has 32345 states and 99497 transitions. Word has length 67 [2019-12-27 17:27:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:19,804 INFO L462 AbstractCegarLoop]: Abstraction has 32345 states and 99497 transitions. [2019-12-27 17:27:19,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 17:27:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 32345 states and 99497 transitions. [2019-12-27 17:27:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:27:19,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:19,838 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 17:27:19,839 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 17:27:19,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:19,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1038037876, now seen corresponding path program 1 times [2019-12-27 17:27:19,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:19,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964002256] [2019-12-27 17:27:19,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:19,958 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 17:27:19,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964002256] [2019-12-27 17:27:19,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:19,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:27:19,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [631973568] [2019-12-27 17:27:19,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:19,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:20,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 344 transitions. [2019-12-27 17:27:20,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:20,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:27:20,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:27:20,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:27:20,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:27:20,248 INFO L87 Difference]: Start difference. First operand 32345 states and 99497 transitions. Second operand 6 states. [2019-12-27 17:27:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:20,422 INFO L93 Difference]: Finished difference Result 32165 states and 98674 transitions. [2019-12-27 17:27:20,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:27:20,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 17:27:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:20,470 INFO L225 Difference]: With dead ends: 32165 [2019-12-27 17:27:20,470 INFO L226 Difference]: Without dead ends: 32165 [2019-12-27 17:27:20,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 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 17:27:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32165 states. [2019-12-27 17:27:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32165 to 25697. [2019-12-27 17:27:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25697 states. [2019-12-27 17:27:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25697 states to 25697 states and 77800 transitions. [2019-12-27 17:27:21,054 INFO L78 Accepts]: Start accepts. Automaton has 25697 states and 77800 transitions. Word has length 67 [2019-12-27 17:27:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:21,054 INFO L462 AbstractCegarLoop]: Abstraction has 25697 states and 77800 transitions. [2019-12-27 17:27:21,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:27:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25697 states and 77800 transitions. [2019-12-27 17:27:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:27:21,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:21,083 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 17:27:21,083 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 17:27:21,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 2 times [2019-12-27 17:27:21,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:21,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485669747] [2019-12-27 17:27:21,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:27:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:27:21,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:27:21,193 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:27:21,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_26|) 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1388~0.base_26|) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_26|) |v_ULTIMATE.start_main_~#t1388~0.offset_19| 0)) |v_#memory_int_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_26| 1) |v_#valid_69|) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1388~0.base_26| 4)) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t1388~0.offset_19| 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_~#t1388~0.base=|v_ULTIMATE.start_main_~#t1388~0.base_26|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_23|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132, ULTIMATE.start_main_~#t1388~0.offset=|v_ULTIMATE.start_main_~#t1388~0.offset_19|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_12|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1389~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1390~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1388~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1389~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t1388~0.offset, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-27 17:27:21,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1389~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1389~0.offset_8| 0) (not (= |v_ULTIMATE.start_main_~#t1389~0.base_9| 0)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9| 1) |v_#valid_33|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1389~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9|) |v_ULTIMATE.start_main_~#t1389~0.offset_8| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_9|, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1389~0.base, ULTIMATE.start_main_~#t1389~0.offset] because there is no mapped edge [2019-12-27 17:27:21,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.offset_Out1049206012 |P0Thread1of1ForFork0_#in~arg.offset_In1049206012|) (= ~z$w_buff0_used~0_Out1049206012 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1049206012| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1049206012) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1049206012|) (= 0 (mod ~z$w_buff1_used~0_Out1049206012 256)) (= ~z$w_buff1~0_Out1049206012 ~z$w_buff0~0_In1049206012) (= ~z$w_buff1_used~0_Out1049206012 ~z$w_buff0_used~0_In1049206012) (= ~z$w_buff0~0_Out1049206012 1) (= |P0Thread1of1ForFork0_#in~arg.base_In1049206012| P0Thread1of1ForFork0_~arg.base_Out1049206012)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1049206012|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1049206012, ~z$w_buff0~0=~z$w_buff0~0_In1049206012, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1049206012|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1049206012|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1049206012, ~z$w_buff0~0=~z$w_buff0~0_Out1049206012, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1049206012, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1049206012, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1049206012|, ~z$w_buff1~0=~z$w_buff1~0_Out1049206012, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1049206012, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1049206012|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1049206012} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 17:27:21,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1390~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11|) |v_ULTIMATE.start_main_~#t1390~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1390~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1390~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1390~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1390~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-27 17:27:21,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1378790285 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1378790285 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1378790285| |P1Thread1of1ForFork1_#t~ite10_Out-1378790285|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1378790285| ~z$w_buff1~0_In-1378790285) (not .cse0) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1378790285| ~z~0_In-1378790285) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1378790285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1378790285, ~z$w_buff1~0=~z$w_buff1~0_In-1378790285, ~z~0=~z~0_In-1378790285} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1378790285|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1378790285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1378790285, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1378790285|, ~z$w_buff1~0=~z$w_buff1~0_In-1378790285, ~z~0=~z~0_In-1378790285} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 17:27:21,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-313554401 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-313554401 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-313554401|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-313554401| ~z$w_buff0_used~0_In-313554401)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-313554401, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-313554401} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-313554401, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-313554401|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-313554401} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:27:21,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In1146463733 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1146463733 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1146463733 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1146463733 256) 0))) (or (and (= ~z$w_buff1_used~0_In1146463733 |P1Thread1of1ForFork1_#t~ite12_Out1146463733|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out1146463733| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1146463733, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1146463733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146463733, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1146463733} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1146463733, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1146463733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146463733, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1146463733|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1146463733} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:27:21,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In664400692 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In664400692 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out664400692| ~z$r_buff0_thd2~0_In664400692)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out664400692| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In664400692, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In664400692} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In664400692, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out664400692|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In664400692} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 17:27:21,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In879869669 256)))) (or (and (= ~z$w_buff1~0_In879869669 |P2Thread1of1ForFork2_#t~ite23_Out879869669|) (= |P2Thread1of1ForFork2_#t~ite24_Out879869669| |P2Thread1of1ForFork2_#t~ite23_Out879869669|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In879869669 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In879869669 256) 0) .cse0) (and (= (mod ~z$r_buff1_thd3~0_In879869669 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In879869669 256) 0))) .cse1) (and (= ~z$w_buff1~0_In879869669 |P2Thread1of1ForFork2_#t~ite24_Out879869669|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite23_In879869669| |P2Thread1of1ForFork2_#t~ite23_Out879869669|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In879869669|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In879869669, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In879869669, ~z$w_buff1_used~0=~z$w_buff1_used~0_In879869669, ~z$w_buff1~0=~z$w_buff1~0_In879869669, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In879869669, ~weak$$choice2~0=~weak$$choice2~0_In879869669} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out879869669|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out879869669|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In879869669, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In879869669, ~z$w_buff1_used~0=~z$w_buff1_used~0_In879869669, ~z$w_buff1~0=~z$w_buff1~0_In879869669, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In879869669, ~weak$$choice2~0=~weak$$choice2~0_In879869669} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 17:27:21,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-934813367 256) 0))) (or (and (= ~z$w_buff0_used~0_In-934813367 |P2Thread1of1ForFork2_#t~ite26_Out-934813367|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-934813367 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-934813367 256))) (= 0 (mod ~z$w_buff0_used~0_In-934813367 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-934813367 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite27_Out-934813367| |P2Thread1of1ForFork2_#t~ite26_Out-934813367|)) (and (= |P2Thread1of1ForFork2_#t~ite26_In-934813367| |P2Thread1of1ForFork2_#t~ite26_Out-934813367|) (= |P2Thread1of1ForFork2_#t~ite27_Out-934813367| ~z$w_buff0_used~0_In-934813367) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-934813367|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-934813367, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-934813367, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-934813367, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-934813367, ~weak$$choice2~0=~weak$$choice2~0_In-934813367} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-934813367|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-934813367, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-934813367, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-934813367, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-934813367, ~weak$$choice2~0=~weak$$choice2~0_In-934813367, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-934813367|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 17:27:21,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-517943598 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-517943598 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-517943598 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-517943598 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-517943598 |P1Thread1of1ForFork1_#t~ite14_Out-517943598|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-517943598|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-517943598, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-517943598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517943598, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-517943598} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-517943598, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-517943598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517943598, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-517943598|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-517943598} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:27:21,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:27:21,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1403851447 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite30_Out1403851447| ~z$w_buff1_used~0_In1403851447) (= |P2Thread1of1ForFork2_#t~ite29_In1403851447| |P2Thread1of1ForFork2_#t~ite29_Out1403851447|)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out1403851447| ~z$w_buff1_used~0_In1403851447) .cse0 (= |P2Thread1of1ForFork2_#t~ite30_Out1403851447| |P2Thread1of1ForFork2_#t~ite29_Out1403851447|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1403851447 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1403851447 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In1403851447 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1403851447 256) 0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1403851447, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1403851447, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1403851447, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1403851447, ~weak$$choice2~0=~weak$$choice2~0_In1403851447, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1403851447|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1403851447|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1403851447, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1403851447, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1403851447, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1403851447, ~weak$$choice2~0=~weak$$choice2~0_In1403851447, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1403851447|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 17:27:21,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 17:27:21,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 17:27:21,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1096762235 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1096762235 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1096762235| ~z$w_buff0_used~0_In-1096762235) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1096762235| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1096762235, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1096762235} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1096762235|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1096762235, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1096762235} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:27:21,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1956530107 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1956530107 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1956530107 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1956530107 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1956530107|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1956530107| ~z$w_buff1_used~0_In-1956530107) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1956530107, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1956530107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1956530107, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1956530107} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1956530107|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1956530107, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1956530107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1956530107, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1956530107} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:27:21,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In208375794 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In208375794 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out208375794 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out208375794 ~z$r_buff0_thd1~0_In208375794) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In208375794, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In208375794} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In208375794, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out208375794|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out208375794} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:27:21,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-449242783 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-449242783 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-449242783 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-449242783 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-449242783|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In-449242783 |P0Thread1of1ForFork0_#t~ite8_Out-449242783|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-449242783, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-449242783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-449242783, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-449242783} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-449242783, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-449242783|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-449242783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-449242783, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-449242783} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:27:21,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:27:21,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out1457273009| |P2Thread1of1ForFork2_#t~ite38_Out1457273009|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1457273009 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1457273009 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1457273009| ~z$w_buff1~0_In1457273009) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In1457273009 |P2Thread1of1ForFork2_#t~ite38_Out1457273009|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1457273009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1457273009, ~z$w_buff1~0=~z$w_buff1~0_In1457273009, ~z~0=~z~0_In1457273009} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1457273009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1457273009, ~z$w_buff1~0=~z$w_buff1~0_In1457273009, ~z~0=~z~0_In1457273009, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1457273009|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1457273009|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 17:27:21,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1025900431 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1025900431 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1025900431| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1025900431| ~z$w_buff0_used~0_In-1025900431)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1025900431, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1025900431} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1025900431, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1025900431, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1025900431|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 17:27:21,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-444788057 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-444788057 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-444788057 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-444788057 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out-444788057| 0)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out-444788057| ~z$w_buff1_used~0_In-444788057) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-444788057, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-444788057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-444788057, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-444788057} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-444788057|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-444788057, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-444788057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-444788057, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-444788057} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 17:27:21,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1665614030 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1665614030 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out1665614030| ~z$r_buff0_thd3~0_In1665614030)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out1665614030|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1665614030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1665614030} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1665614030|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1665614030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1665614030} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 17:27:21,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In1390051935 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1390051935 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1390051935 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1390051935 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1390051935 |P2Thread1of1ForFork2_#t~ite43_Out1390051935|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite43_Out1390051935| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1390051935, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1390051935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1390051935, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1390051935} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1390051935, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1390051935, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1390051935|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1390051935, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1390051935} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 17:27:21,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 17:27:21,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:27:21,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1501614018 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1501614018 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out1501614018| |ULTIMATE.start_main_#t~ite47_Out1501614018|))) (or (and (= ~z$w_buff1~0_In1501614018 |ULTIMATE.start_main_#t~ite47_Out1501614018|) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~z~0_In1501614018 |ULTIMATE.start_main_#t~ite47_Out1501614018|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1501614018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1501614018, ~z$w_buff1~0=~z$w_buff1~0_In1501614018, ~z~0=~z~0_In1501614018} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1501614018, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1501614018|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1501614018, ~z$w_buff1~0=~z$w_buff1~0_In1501614018, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1501614018|, ~z~0=~z~0_In1501614018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 17:27:21,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In405226702 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In405226702 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out405226702|) (not .cse1)) (and (= ~z$w_buff0_used~0_In405226702 |ULTIMATE.start_main_#t~ite49_Out405226702|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In405226702, ~z$w_buff0_used~0=~z$w_buff0_used~0_In405226702} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In405226702, ~z$w_buff0_used~0=~z$w_buff0_used~0_In405226702, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out405226702|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 17:27:21,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-377931566 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-377931566 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-377931566 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-377931566 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-377931566 |ULTIMATE.start_main_#t~ite50_Out-377931566|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out-377931566| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-377931566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-377931566, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-377931566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-377931566} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-377931566|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-377931566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-377931566, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-377931566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-377931566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 17:27:21,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1457358738 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1457358738 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1457358738| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1457358738 |ULTIMATE.start_main_#t~ite51_Out-1457358738|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1457358738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1457358738} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1457358738, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1457358738|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1457358738} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 17:27:21,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In814248908 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In814248908 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In814248908 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In814248908 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In814248908 |ULTIMATE.start_main_#t~ite52_Out814248908|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out814248908|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In814248908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In814248908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In814248908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In814248908} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out814248908|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In814248908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In814248908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In814248908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In814248908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 17:27:21,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:27:21,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:27:21 BasicIcfg [2019-12-27 17:27:21,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:27:21,342 INFO L168 Benchmark]: Toolchain (without parser) took 170724.82 ms. Allocated memory was 146.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 17:27:21,342 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 17:27:21,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.02 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 100.4 MB in the beginning and 157.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:27:21,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.27 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:27:21,347 INFO L168 Benchmark]: Boogie Preprocessor took 40.36 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:27:21,347 INFO L168 Benchmark]: RCFGBuilder took 852.57 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:27:21,348 INFO L168 Benchmark]: TraceAbstraction took 168981.77 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 959.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:27:21,352 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.24 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.02 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 100.4 MB in the beginning and 157.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.27 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.36 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.57 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 168981.77 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 959.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 168.6s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 82.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8465 SDtfs, 23587 SDslu, 40721 SDs, 0 SdLazy, 32095 SolverSat, 2088 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1272 GetRequests, 332 SyntacticMatches, 125 SemanticMatches, 815 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20770 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 45.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 610684 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1659 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1561 ConstructedInterpolants, 0 QuantifiedInterpolants, 383801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...