/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/mix003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:32:53,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:32:53,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:32:53,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:32:53,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:32:53,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:32:53,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:32:53,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:32:53,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:32:53,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:32:53,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:32:53,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:32:53,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:32:53,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:32:53,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:32:53,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:32:53,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:32:53,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:32:53,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:32:53,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:32:53,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:32:53,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:32:53,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:32:53,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:32:53,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:32:53,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:32:53,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:32:53,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:32:53,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:32:53,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:32:53,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:32:53,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:32:53,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:32:53,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:32:53,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:32:53,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:32:53,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:32:53,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:32:53,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:32:53,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:32:53,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:32:53,406 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 15:32:53,420 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:32:53,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:32:53,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:32:53,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:32:53,422 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:32:53,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:32:53,423 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:32:53,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:32:53,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:32:53,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:32:53,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:32:53,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:32:53,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:32:53,426 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:32:53,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:32:53,427 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:32:53,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:32:53,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:32:53,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:32:53,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:32:53,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:32:53,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:32:53,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:32:53,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:32:53,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:32:53,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:32:53,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:32:53,430 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:32:53,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:32:53,430 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:32:53,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:32:53,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:32:53,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:32:53,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:32:53,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:32:53,741 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:32:53,743 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2019-12-27 15:32:53,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af888125a/6c5559e5c3994118887d3baaa3399341/FLAGb8c020197 [2019-12-27 15:32:54,318 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:32:54,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2019-12-27 15:32:54,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af888125a/6c5559e5c3994118887d3baaa3399341/FLAGb8c020197 [2019-12-27 15:32:54,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af888125a/6c5559e5c3994118887d3baaa3399341 [2019-12-27 15:32:54,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:32:54,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:32:54,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:32:54,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:32:54,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:32:54,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:32:54" (1/1) ... [2019-12-27 15:32:54,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee1d159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:54, skipping insertion in model container [2019-12-27 15:32:54,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:32:54" (1/1) ... [2019-12-27 15:32:54,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:32:54,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:32:55,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:32:55,188 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:32:55,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:32:55,342 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:32:55,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55 WrapperNode [2019-12-27 15:32:55,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:32:55,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:32:55,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:32:55,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:32:55,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:32:55,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:32:55,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:32:55,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:32:55,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (1/1) ... [2019-12-27 15:32:55,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:32:55,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:32:55,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:32:55,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:32:55,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (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 15:32:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:32:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:32:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:32:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:32:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:32:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:32:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:32:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:32:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:32:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:32:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:32:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:32:55,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:32:55,536 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 15:32:56,308 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:32:56,309 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:32:56,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:32:56 BoogieIcfgContainer [2019-12-27 15:32:56,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:32:56,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:32:56,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:32:56,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:32:56,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:32:54" (1/3) ... [2019-12-27 15:32:56,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb3ee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:32:56, skipping insertion in model container [2019-12-27 15:32:56,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:55" (2/3) ... [2019-12-27 15:32:56,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb3ee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:32:56, skipping insertion in model container [2019-12-27 15:32:56,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:32:56" (3/3) ... [2019-12-27 15:32:56,320 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_rmo.oepc.i [2019-12-27 15:32:56,331 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:32:56,331 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:32:56,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:32:56,341 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:32:56,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,396 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,396 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,404 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,405 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,453 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,455 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:56,486 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:32:56,509 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:32:56,510 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:32:56,510 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:32:56,510 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:32:56,510 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:32:56,510 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:32:56,510 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:32:56,510 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:32:56,534 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 15:32:56,537 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 15:32:56,666 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 15:32:56,666 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:32:56,683 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:32:56,707 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 15:32:56,796 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 15:32:56,797 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:32:56,806 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:32:56,826 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:32:56,827 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:33:01,715 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-27 15:33:02,054 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 15:33:02,232 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 15:33:02,597 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-27 15:33:02,597 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 15:33:02,601 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 15:33:23,412 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 15:33:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 15:33:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:33:23,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:23,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:33:23,420 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 15:33:23,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:23,425 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-27 15:33:23,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:23,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832565827] [2019-12-27 15:33:23,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:23,659 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 15:33:23,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832565827] [2019-12-27 15:33:23,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:23,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:33:23,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1512268481] [2019-12-27 15:33:23,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:23,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:23,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:33:23,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:23,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:23,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:23,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:23,702 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 15:33:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:25,227 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-27 15:33:25,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:25,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:33:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:25,835 INFO L225 Difference]: With dead ends: 119613 [2019-12-27 15:33:25,835 INFO L226 Difference]: Without dead ends: 105755 [2019-12-27 15:33:25,837 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 15:33:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-27 15:33:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-27 15:33:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-27 15:33:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-27 15:33:36,630 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-27 15:33:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:36,630 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-27 15:33:36,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-27 15:33:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:33:36,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:36,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:36,636 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 15:33:36,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:36,637 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-27 15:33:36,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:36,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689809294] [2019-12-27 15:33:36,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:36,737 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 15:33:36,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689809294] [2019-12-27 15:33:36,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:36,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:36,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [135969264] [2019-12-27 15:33:36,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:36,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:36,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:33:36,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:36,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:36,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:36,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:36,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:36,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:36,750 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-27 15:33:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:41,556 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-27 15:33:41,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:33:41,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:33:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:42,278 INFO L225 Difference]: With dead ends: 168845 [2019-12-27 15:33:42,279 INFO L226 Difference]: Without dead ends: 168747 [2019-12-27 15:33:42,280 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 15:33:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-27 15:33:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-27 15:33:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-27 15:33:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-27 15:33:56,638 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-27 15:33:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:56,639 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-27 15:33:56,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-27 15:33:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:33:56,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:56,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:56,646 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 15:33:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:56,647 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-27 15:33:56,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:56,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624677792] [2019-12-27 15:33:56,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:56,718 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 15:33:56,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624677792] [2019-12-27 15:33:56,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:56,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:56,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239360124] [2019-12-27 15:33:56,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:56,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:56,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:33:56,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:56,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:56,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:56,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:56,733 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-27 15:33:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:56,870 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-27 15:33:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:56,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:33:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:56,935 INFO L225 Difference]: With dead ends: 33476 [2019-12-27 15:33:56,936 INFO L226 Difference]: Without dead ends: 33476 [2019-12-27 15:33:56,936 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 15:33:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-27 15:33:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-27 15:33:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-27 15:33:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-27 15:33:57,602 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-27 15:33:57,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:57,603 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-27 15:33:57,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:57,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-27 15:33:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:33:57,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:57,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:57,606 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 15:33:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-27 15:33:57,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:57,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832415038] [2019-12-27 15:33:57,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:57,731 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 15:33:57,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832415038] [2019-12-27 15:33:57,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:57,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:57,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497180619] [2019-12-27 15:33:57,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:57,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:57,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:33:57,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:57,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:57,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:57,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:57,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:57,742 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-27 15:34:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:00,469 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-27 15:34:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:34:00,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:34:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:00,543 INFO L225 Difference]: With dead ends: 41508 [2019-12-27 15:34:00,543 INFO L226 Difference]: Without dead ends: 41508 [2019-12-27 15:34:00,543 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 15:34:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-27 15:34:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-27 15:34:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-27 15:34:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-27 15:34:01,380 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-27 15:34:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:01,381 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-27 15:34:01,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:34:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-27 15:34:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:34:01,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:01,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:34:01,385 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 15:34:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:01,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-27 15:34:01,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:01,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801704661] [2019-12-27 15:34:01,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:34:01,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801704661] [2019-12-27 15:34:01,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:01,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:34:01,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992428182] [2019-12-27 15:34:01,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:01,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:01,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:34:01,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:01,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:34:01,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:34:01,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:34:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:34:01,438 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-27 15:34:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:01,679 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-27 15:34:01,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:34:01,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 15:34:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:01,775 INFO L225 Difference]: With dead ends: 54855 [2019-12-27 15:34:01,776 INFO L226 Difference]: Without dead ends: 54855 [2019-12-27 15:34:01,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:34:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-27 15:34:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-27 15:34:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-27 15:34:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-27 15:34:03,178 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-27 15:34:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:03,179 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-27 15:34:03,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:34:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-27 15:34:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:34:03,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:03,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:34:03,183 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 15:34:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-27 15:34:03,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:03,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473804672] [2019-12-27 15:34:03,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:03,267 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 15:34:03,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473804672] [2019-12-27 15:34:03,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:03,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:34:03,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340128872] [2019-12-27 15:34:03,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:03,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:03,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:34:03,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:03,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:34:03,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:34:03,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:03,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:34:03,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:34:03,274 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-27 15:34:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:03,633 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-27 15:34:03,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:34:03,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:34:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:03,719 INFO L225 Difference]: With dead ends: 49903 [2019-12-27 15:34:03,719 INFO L226 Difference]: Without dead ends: 49903 [2019-12-27 15:34:03,719 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 15:34:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-27 15:34:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-27 15:34:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-27 15:34:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-27 15:34:04,520 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-27 15:34:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:04,521 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-27 15:34:04,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:34:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-27 15:34:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:34:04,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:04,531 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 15:34:04,531 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 15:34:04,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-27 15:34:04,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:04,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494744679] [2019-12-27 15:34:04,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:04,616 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 15:34:04,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494744679] [2019-12-27 15:34:04,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:04,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:34:04,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2121358118] [2019-12-27 15:34:04,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:04,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:04,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:34:04,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:04,666 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:34:04,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:34:04,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:04,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:34:04,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:34:04,668 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 6 states. [2019-12-27 15:34:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:05,420 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-27 15:34:05,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:34:05,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:34:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:05,521 INFO L225 Difference]: With dead ends: 59763 [2019-12-27 15:34:05,521 INFO L226 Difference]: Without dead ends: 59749 [2019-12-27 15:34:05,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:34:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-27 15:34:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-27 15:34:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-27 15:34:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-27 15:34:06,716 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-27 15:34:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:06,716 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-27 15:34:06,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:34:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-27 15:34:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:34:06,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:06,726 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 15:34:06,726 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 15:34:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-27 15:34:06,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:06,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745291008] [2019-12-27 15:34:06,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:06,801 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 15:34:06,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745291008] [2019-12-27 15:34:06,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:06,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:34:06,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [6961030] [2019-12-27 15:34:06,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:06,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:06,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:34:06,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:06,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:34:06,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:34:06,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:06,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:34:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:34:06,827 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 6 states. [2019-12-27 15:34:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:07,619 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-27 15:34:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:34:07,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:34:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:07,725 INFO L225 Difference]: With dead ends: 62779 [2019-12-27 15:34:07,725 INFO L226 Difference]: Without dead ends: 62765 [2019-12-27 15:34:07,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:34:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-27 15:34:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-27 15:34:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-27 15:34:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-27 15:34:09,126 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-27 15:34:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:09,126 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-27 15:34:09,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:34:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-27 15:34:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:34:09,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:09,142 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 15:34:09,142 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 15:34:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-27 15:34:09,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:09,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723456845] [2019-12-27 15:34:09,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:09,189 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 15:34:09,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723456845] [2019-12-27 15:34:09,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:09,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:34:09,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665046095] [2019-12-27 15:34:09,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:09,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:09,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:34:09,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:09,220 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:34:09,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:34:09,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:09,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:34:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:34:09,221 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 5 states. [2019-12-27 15:34:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:09,305 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-27 15:34:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:34:09,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:34:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:09,330 INFO L225 Difference]: With dead ends: 17503 [2019-12-27 15:34:09,331 INFO L226 Difference]: Without dead ends: 17503 [2019-12-27 15:34:09,331 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 15:34:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-27 15:34:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-27 15:34:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 15:34:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-27 15:34:09,598 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-27 15:34:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:09,599 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-27 15:34:09,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:34:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-27 15:34:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:34:09,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:09,612 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 15:34:09,613 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 15:34:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:09,613 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-27 15:34:09,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:09,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069670424] [2019-12-27 15:34:09,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:09,654 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 15:34:09,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069670424] [2019-12-27 15:34:09,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:09,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:34:09,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1718240238] [2019-12-27 15:34:09,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:09,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:09,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:34:09,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:09,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:34:09,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:34:09,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:34:09,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:34:09,666 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-27 15:34:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:09,795 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-27 15:34:09,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:34:09,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 15:34:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:09,838 INFO L225 Difference]: With dead ends: 22571 [2019-12-27 15:34:09,838 INFO L226 Difference]: Without dead ends: 22571 [2019-12-27 15:34:09,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:34:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-27 15:34:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-27 15:34:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 15:34:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-27 15:34:10,176 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-27 15:34:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:10,176 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-27 15:34:10,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:34:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-27 15:34:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:34:10,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:10,188 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 15:34:10,189 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 15:34:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-27 15:34:10,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:10,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398516289] [2019-12-27 15:34:10,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:10,245 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 15:34:10,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398516289] [2019-12-27 15:34:10,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:10,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:34:10,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [148328363] [2019-12-27 15:34:10,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:10,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:10,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:34:10,256 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:10,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:34:10,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:34:10,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:10,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:34:10,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:34:10,257 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-27 15:34:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:10,646 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-27 15:34:10,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:34:10,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 15:34:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:10,684 INFO L225 Difference]: With dead ends: 21146 [2019-12-27 15:34:10,684 INFO L226 Difference]: Without dead ends: 21146 [2019-12-27 15:34:10,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:34:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-27 15:34:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-27 15:34:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-27 15:34:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-27 15:34:11,013 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-27 15:34:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:11,014 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-27 15:34:11,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:34:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-27 15:34:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:34:11,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:11,028 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] [2019-12-27 15:34:11,028 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 15:34:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-27 15:34:11,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:11,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283245033] [2019-12-27 15:34:11,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:34:11,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283245033] [2019-12-27 15:34:11,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:11,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:34:11,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261565997] [2019-12-27 15:34:11,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:11,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:11,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 15:34:11,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:11,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:34:11,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:34:11,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:34:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:34:11,122 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-27 15:34:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:11,506 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-27 15:34:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:34:11,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 15:34:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:11,547 INFO L225 Difference]: With dead ends: 23192 [2019-12-27 15:34:11,548 INFO L226 Difference]: Without dead ends: 23192 [2019-12-27 15:34:11,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:34:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-27 15:34:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-27 15:34:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-27 15:34:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-27 15:34:12,076 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-27 15:34:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:12,077 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-27 15:34:12,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:34:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-27 15:34:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:34:12,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:12,099 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 15:34:12,099 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 15:34:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-27 15:34:12,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:12,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565794938] [2019-12-27 15:34:12,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:12,195 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 15:34:12,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565794938] [2019-12-27 15:34:12,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:12,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:34:12,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [230426195] [2019-12-27 15:34:12,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:12,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:12,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:34:12,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:12,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:34:12,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:34:12,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:34:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:34:12,229 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 7 states. [2019-12-27 15:34:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:13,218 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-27 15:34:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:34:13,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:34:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:13,265 INFO L225 Difference]: With dead ends: 26785 [2019-12-27 15:34:13,265 INFO L226 Difference]: Without dead ends: 26785 [2019-12-27 15:34:13,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:34:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-27 15:34:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-27 15:34:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-27 15:34:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-27 15:34:13,659 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-27 15:34:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:13,660 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-27 15:34:13,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:34:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-27 15:34:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:34:13,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:13,680 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] [2019-12-27 15:34:13,680 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 15:34:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-27 15:34:13,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:13,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838981343] [2019-12-27 15:34:13,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:13,774 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 15:34:13,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838981343] [2019-12-27 15:34:13,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:13,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:34:13,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970510781] [2019-12-27 15:34:13,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:13,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:13,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 15:34:13,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:13,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:34:13,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:34:13,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:13,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:34:13,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:34:13,815 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 7 states. [2019-12-27 15:34:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:14,707 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-27 15:34:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:34:14,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 15:34:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:14,762 INFO L225 Difference]: With dead ends: 25915 [2019-12-27 15:34:14,763 INFO L226 Difference]: Without dead ends: 25915 [2019-12-27 15:34:14,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:34:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-27 15:34:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-27 15:34:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-27 15:34:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-27 15:34:15,153 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-27 15:34:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:15,154 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-27 15:34:15,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:34:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-27 15:34:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:34:15,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:15,170 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 15:34:15,171 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 15:34:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-27 15:34:15,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:15,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018304672] [2019-12-27 15:34:15,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:15,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 15:34:15,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018304672] [2019-12-27 15:34:15,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:15,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:34:15,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028719642] [2019-12-27 15:34:15,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:15,233 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:15,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 271 transitions. [2019-12-27 15:34:15,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:15,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:34:15,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:34:15,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:15,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:34:15,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:34:15,281 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-27 15:34:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:15,342 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-27 15:34:15,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:34:15,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:34:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:15,367 INFO L225 Difference]: With dead ends: 17953 [2019-12-27 15:34:15,367 INFO L226 Difference]: Without dead ends: 17953 [2019-12-27 15:34:15,368 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 15:34:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-27 15:34:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-27 15:34:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-27 15:34:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-27 15:34:15,751 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-27 15:34:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:15,752 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-27 15:34:15,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:34:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-27 15:34:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:34:15,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:15,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:34:15,768 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 15:34:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-27 15:34:15,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:15,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393957049] [2019-12-27 15:34:15,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:15,863 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 15:34:15,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393957049] [2019-12-27 15:34:15,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:15,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:34:15,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [286303115] [2019-12-27 15:34:15,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:15,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:15,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 331 transitions. [2019-12-27 15:34:15,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:15,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:34:15,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:34:15,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:34:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:34:15,949 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 3 states. [2019-12-27 15:34:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:16,034 INFO L93 Difference]: Finished difference Result 17953 states and 53342 transitions. [2019-12-27 15:34:16,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:34:16,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 15:34:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:16,067 INFO L225 Difference]: With dead ends: 17953 [2019-12-27 15:34:16,067 INFO L226 Difference]: Without dead ends: 17953 [2019-12-27 15:34:16,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:34:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-27 15:34:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 16037. [2019-12-27 15:34:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16037 states. [2019-12-27 15:34:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16037 states to 16037 states and 48092 transitions. [2019-12-27 15:34:16,380 INFO L78 Accepts]: Start accepts. Automaton has 16037 states and 48092 transitions. Word has length 40 [2019-12-27 15:34:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:16,380 INFO L462 AbstractCegarLoop]: Abstraction has 16037 states and 48092 transitions. [2019-12-27 15:34:16,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:34:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 16037 states and 48092 transitions. [2019-12-27 15:34:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:34:16,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:16,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:34:16,400 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 15:34:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash -935567252, now seen corresponding path program 1 times [2019-12-27 15:34:16,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:16,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961654142] [2019-12-27 15:34:16,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:16,449 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 15:34:16,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961654142] [2019-12-27 15:34:16,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:16,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:34:16,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1135168378] [2019-12-27 15:34:16,450 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:16,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:16,531 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 331 transitions. [2019-12-27 15:34:16,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:16,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:34:16,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:34:16,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:16,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:34:16,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:34:16,564 INFO L87 Difference]: Start difference. First operand 16037 states and 48092 transitions. Second operand 7 states. [2019-12-27 15:34:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:16,646 INFO L93 Difference]: Finished difference Result 14868 states and 45573 transitions. [2019-12-27 15:34:16,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:34:16,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 15:34:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:16,672 INFO L225 Difference]: With dead ends: 14868 [2019-12-27 15:34:16,673 INFO L226 Difference]: Without dead ends: 14868 [2019-12-27 15:34:16,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:34:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14868 states. [2019-12-27 15:34:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14868 to 14868. [2019-12-27 15:34:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14868 states. [2019-12-27 15:34:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14868 states to 14868 states and 45573 transitions. [2019-12-27 15:34:16,922 INFO L78 Accepts]: Start accepts. Automaton has 14868 states and 45573 transitions. Word has length 41 [2019-12-27 15:34:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:16,923 INFO L462 AbstractCegarLoop]: Abstraction has 14868 states and 45573 transitions. [2019-12-27 15:34:16,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:34:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 14868 states and 45573 transitions. [2019-12-27 15:34:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:34:16,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:16,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:34:16,943 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:34:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash -344664589, now seen corresponding path program 1 times [2019-12-27 15:34:16,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:16,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454932542] [2019-12-27 15:34:16,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:17,031 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 15:34:17,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454932542] [2019-12-27 15:34:17,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:17,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:34:17,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285130482] [2019-12-27 15:34:17,033 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:17,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:17,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 565 transitions. [2019-12-27 15:34:17,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:17,298 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:34:17,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:34:17,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:17,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:34:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:34:17,300 INFO L87 Difference]: Start difference. First operand 14868 states and 45573 transitions. Second operand 9 states. [2019-12-27 15:34:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:20,470 INFO L93 Difference]: Finished difference Result 68244 states and 204778 transitions. [2019-12-27 15:34:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 15:34:20,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:34:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:20,546 INFO L225 Difference]: With dead ends: 68244 [2019-12-27 15:34:20,546 INFO L226 Difference]: Without dead ends: 53526 [2019-12-27 15:34:20,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:34:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53526 states. [2019-12-27 15:34:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53526 to 18516. [2019-12-27 15:34:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18516 states. [2019-12-27 15:34:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18516 states to 18516 states and 56848 transitions. [2019-12-27 15:34:21,092 INFO L78 Accepts]: Start accepts. Automaton has 18516 states and 56848 transitions. Word has length 65 [2019-12-27 15:34:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:21,092 INFO L462 AbstractCegarLoop]: Abstraction has 18516 states and 56848 transitions. [2019-12-27 15:34:21,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:34:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18516 states and 56848 transitions. [2019-12-27 15:34:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:34:21,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:21,110 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 15:34:21,110 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 15:34:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1662753005, now seen corresponding path program 2 times [2019-12-27 15:34:21,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:21,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187154166] [2019-12-27 15:34:21,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:21,199 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 15:34:21,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187154166] [2019-12-27 15:34:21,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:21,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:34:21,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028373588] [2019-12-27 15:34:21,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:21,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:21,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 294 states and 570 transitions. [2019-12-27 15:34:21,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:21,578 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:34:21,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:34:21,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:34:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:34:21,579 INFO L87 Difference]: Start difference. First operand 18516 states and 56848 transitions. Second operand 8 states. [2019-12-27 15:34:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:23,749 INFO L93 Difference]: Finished difference Result 58158 states and 175925 transitions. [2019-12-27 15:34:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:34:23,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:34:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:23,808 INFO L225 Difference]: With dead ends: 58158 [2019-12-27 15:34:23,809 INFO L226 Difference]: Without dead ends: 43599 [2019-12-27 15:34:23,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:34:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43599 states. [2019-12-27 15:34:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43599 to 21947. [2019-12-27 15:34:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21947 states. [2019-12-27 15:34:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21947 states to 21947 states and 66970 transitions. [2019-12-27 15:34:24,327 INFO L78 Accepts]: Start accepts. Automaton has 21947 states and 66970 transitions. Word has length 65 [2019-12-27 15:34:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:24,327 INFO L462 AbstractCegarLoop]: Abstraction has 21947 states and 66970 transitions. [2019-12-27 15:34:24,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:34:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 21947 states and 66970 transitions. [2019-12-27 15:34:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:34:24,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:24,351 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 15:34:24,352 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 15:34:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:24,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1251052155, now seen corresponding path program 3 times [2019-12-27 15:34:24,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:24,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039490602] [2019-12-27 15:34:24,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:24,422 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 15:34:24,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039490602] [2019-12-27 15:34:24,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:24,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:34:24,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701407601] [2019-12-27 15:34:24,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:24,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:24,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 420 transitions. [2019-12-27 15:34:24,686 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:24,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 15:34:24,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:34:24,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:24,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:34:24,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:34:24,894 INFO L87 Difference]: Start difference. First operand 21947 states and 66970 transitions. Second operand 9 states. [2019-12-27 15:34:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:26,002 INFO L93 Difference]: Finished difference Result 74450 states and 224972 transitions. [2019-12-27 15:34:26,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:34:26,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:34:26,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:26,104 INFO L225 Difference]: With dead ends: 74450 [2019-12-27 15:34:26,104 INFO L226 Difference]: Without dead ends: 71739 [2019-12-27 15:34:26,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 16 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:34:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71739 states. [2019-12-27 15:34:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71739 to 22043. [2019-12-27 15:34:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22043 states. [2019-12-27 15:34:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22043 states to 22043 states and 67314 transitions. [2019-12-27 15:34:27,115 INFO L78 Accepts]: Start accepts. Automaton has 22043 states and 67314 transitions. Word has length 65 [2019-12-27 15:34:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:27,115 INFO L462 AbstractCegarLoop]: Abstraction has 22043 states and 67314 transitions. [2019-12-27 15:34:27,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:34:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 22043 states and 67314 transitions. [2019-12-27 15:34:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:34:27,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:27,139 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 15:34:27,139 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 15:34:27,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:27,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1414187811, now seen corresponding path program 4 times [2019-12-27 15:34:27,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:27,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166635383] [2019-12-27 15:34:27,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:27,202 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 15:34:27,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166635383] [2019-12-27 15:34:27,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:27,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:34:27,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1446292438] [2019-12-27 15:34:27,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:27,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:27,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 578 transitions. [2019-12-27 15:34:27,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:27,453 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:34:27,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:34:27,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:34:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:34:27,454 INFO L87 Difference]: Start difference. First operand 22043 states and 67314 transitions. Second operand 3 states. [2019-12-27 15:34:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:27,570 INFO L93 Difference]: Finished difference Result 25110 states and 76797 transitions. [2019-12-27 15:34:27,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:34:27,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:34:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:27,603 INFO L225 Difference]: With dead ends: 25110 [2019-12-27 15:34:27,603 INFO L226 Difference]: Without dead ends: 25110 [2019-12-27 15:34:27,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 15:34:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25110 states. [2019-12-27 15:34:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25110 to 20735. [2019-12-27 15:34:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-27 15:34:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 64104 transitions. [2019-12-27 15:34:27,955 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 64104 transitions. Word has length 65 [2019-12-27 15:34:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:27,955 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 64104 transitions. [2019-12-27 15:34:27,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:34:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 64104 transitions. [2019-12-27 15:34:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:34:27,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:27,978 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 15:34:27,978 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 15:34:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1928104461, now seen corresponding path program 1 times [2019-12-27 15:34:27,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:27,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674834914] [2019-12-27 15:34:27,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:28,048 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 15:34:28,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674834914] [2019-12-27 15:34:28,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:28,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:34:28,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266291590] [2019-12-27 15:34:28,050 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:28,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:28,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 341 transitions. [2019-12-27 15:34:28,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:28,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:34:28,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:34:28,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:28,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:34:28,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:34:28,416 INFO L87 Difference]: Start difference. First operand 20735 states and 64104 transitions. Second operand 9 states. [2019-12-27 15:34:30,403 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 15:34:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:31,051 INFO L93 Difference]: Finished difference Result 88116 states and 270041 transitions. [2019-12-27 15:34:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 15:34:31,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 15:34:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:31,168 INFO L225 Difference]: With dead ends: 88116 [2019-12-27 15:34:31,168 INFO L226 Difference]: Without dead ends: 66402 [2019-12-27 15:34:31,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 15:34:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66402 states. [2019-12-27 15:34:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66402 to 23352. [2019-12-27 15:34:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23352 states. [2019-12-27 15:34:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23352 states to 23352 states and 72620 transitions. [2019-12-27 15:34:31,868 INFO L78 Accepts]: Start accepts. Automaton has 23352 states and 72620 transitions. Word has length 66 [2019-12-27 15:34:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:31,868 INFO L462 AbstractCegarLoop]: Abstraction has 23352 states and 72620 transitions. [2019-12-27 15:34:31,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:34:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 23352 states and 72620 transitions. [2019-12-27 15:34:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:34:31,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:31,894 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 15:34:31,895 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 15:34:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash 104538735, now seen corresponding path program 2 times [2019-12-27 15:34:31,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:31,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169102222] [2019-12-27 15:34:31,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:31,964 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 15:34:31,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169102222] [2019-12-27 15:34:31,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:31,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:34:31,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [468279902] [2019-12-27 15:34:31,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:31,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:32,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 293 transitions. [2019-12-27 15:34:32,147 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:32,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:34:32,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:34:32,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:32,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:34:32,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:34:32,149 INFO L87 Difference]: Start difference. First operand 23352 states and 72620 transitions. Second operand 4 states. [2019-12-27 15:34:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:32,299 INFO L93 Difference]: Finished difference Result 23167 states and 71884 transitions. [2019-12-27 15:34:32,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:34:32,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:34:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:32,341 INFO L225 Difference]: With dead ends: 23167 [2019-12-27 15:34:32,341 INFO L226 Difference]: Without dead ends: 23167 [2019-12-27 15:34:32,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 15:34:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23167 states. [2019-12-27 15:34:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23167 to 21888. [2019-12-27 15:34:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21888 states. [2019-12-27 15:34:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21888 states to 21888 states and 67988 transitions. [2019-12-27 15:34:32,721 INFO L78 Accepts]: Start accepts. Automaton has 21888 states and 67988 transitions. Word has length 66 [2019-12-27 15:34:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:32,721 INFO L462 AbstractCegarLoop]: Abstraction has 21888 states and 67988 transitions. [2019-12-27 15:34:32,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:34:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 21888 states and 67988 transitions. [2019-12-27 15:34:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:34:32,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:32,746 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 15:34:32,746 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 15:34:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1162997979, now seen corresponding path program 1 times [2019-12-27 15:34:32,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:32,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8635574] [2019-12-27 15:34:32,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:32,815 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 15:34:32,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8635574] [2019-12-27 15:34:32,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:32,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:34:32,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566810301] [2019-12-27 15:34:32,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:32,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:33,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 307 states and 583 transitions. [2019-12-27 15:34:33,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:33,266 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:34:33,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:34:33,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:34:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:34:33,267 INFO L87 Difference]: Start difference. First operand 21888 states and 67988 transitions. Second operand 4 states. [2019-12-27 15:34:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:33,518 INFO L93 Difference]: Finished difference Result 27150 states and 81441 transitions. [2019-12-27 15:34:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:34:33,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:34:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:33,556 INFO L225 Difference]: With dead ends: 27150 [2019-12-27 15:34:33,556 INFO L226 Difference]: Without dead ends: 27150 [2019-12-27 15:34:33,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:34:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27150 states. [2019-12-27 15:34:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27150 to 18270. [2019-12-27 15:34:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18270 states. [2019-12-27 15:34:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18270 states to 18270 states and 55443 transitions. [2019-12-27 15:34:33,896 INFO L78 Accepts]: Start accepts. Automaton has 18270 states and 55443 transitions. Word has length 66 [2019-12-27 15:34:33,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:33,896 INFO L462 AbstractCegarLoop]: Abstraction has 18270 states and 55443 transitions. [2019-12-27 15:34:33,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:34:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 18270 states and 55443 transitions. [2019-12-27 15:34:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:34:33,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:33,915 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 15:34:33,915 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 15:34:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:33,916 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-27 15:34:33,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:33,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302588612] [2019-12-27 15:34:33,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:34,113 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 15:34:34,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302588612] [2019-12-27 15:34:34,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:34,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:34:34,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340720078] [2019-12-27 15:34:34,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:34,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:34,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 527 transitions. [2019-12-27 15:34:34,337 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:34,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:34:34,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:34:34,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:34:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:34:34,348 INFO L87 Difference]: Start difference. First operand 18270 states and 55443 transitions. Second operand 11 states. [2019-12-27 15:34:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:35,516 INFO L93 Difference]: Finished difference Result 26700 states and 80507 transitions. [2019-12-27 15:34:35,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:34:35,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 15:34:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:35,546 INFO L225 Difference]: With dead ends: 26700 [2019-12-27 15:34:35,546 INFO L226 Difference]: Without dead ends: 22275 [2019-12-27 15:34:35,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:34:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22275 states. [2019-12-27 15:34:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22275 to 18683. [2019-12-27 15:34:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18683 states. [2019-12-27 15:34:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18683 states to 18683 states and 56562 transitions. [2019-12-27 15:34:35,854 INFO L78 Accepts]: Start accepts. Automaton has 18683 states and 56562 transitions. Word has length 67 [2019-12-27 15:34:35,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:35,854 INFO L462 AbstractCegarLoop]: Abstraction has 18683 states and 56562 transitions. [2019-12-27 15:34:35,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:34:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 18683 states and 56562 transitions. [2019-12-27 15:34:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:34:35,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:35,874 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 15:34:35,874 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 15:34:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 2 times [2019-12-27 15:34:35,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:35,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530929987] [2019-12-27 15:34:35,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:36,005 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 15:34:36,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530929987] [2019-12-27 15:34:36,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:36,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:34:36,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994939294] [2019-12-27 15:34:36,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:36,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:36,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 361 states and 739 transitions. [2019-12-27 15:34:36,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:36,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:34:36,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:34:36,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:34:36,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:34:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:34:36,643 INFO L87 Difference]: Start difference. First operand 18683 states and 56562 transitions. Second operand 11 states. [2019-12-27 15:34:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:37,968 INFO L93 Difference]: Finished difference Result 27479 states and 82061 transitions. [2019-12-27 15:34:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 15:34:37,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 15:34:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:38,000 INFO L225 Difference]: With dead ends: 27479 [2019-12-27 15:34:38,001 INFO L226 Difference]: Without dead ends: 23834 [2019-12-27 15:34:38,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:34:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23834 states. [2019-12-27 15:34:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23834 to 18987. [2019-12-27 15:34:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18987 states. [2019-12-27 15:34:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18987 states to 18987 states and 57363 transitions. [2019-12-27 15:34:38,319 INFO L78 Accepts]: Start accepts. Automaton has 18987 states and 57363 transitions. Word has length 67 [2019-12-27 15:34:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:38,319 INFO L462 AbstractCegarLoop]: Abstraction has 18987 states and 57363 transitions. [2019-12-27 15:34:38,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:34:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18987 states and 57363 transitions. [2019-12-27 15:34:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:34:38,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:38,338 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 15:34:38,339 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 15:34:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 3 times [2019-12-27 15:34:38,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:38,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616112876] [2019-12-27 15:34:38,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:38,496 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 15:34:38,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616112876] [2019-12-27 15:34:38,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:38,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:34:38,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741629569] [2019-12-27 15:34:38,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:38,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:38,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 317 states and 640 transitions. [2019-12-27 15:34:38,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:38,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:34:39,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:34:39,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:34:39,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 15:34:39,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:39,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 15:34:39,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:34:39,090 INFO L87 Difference]: Start difference. First operand 18987 states and 57363 transitions. Second operand 14 states. [2019-12-27 15:34:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:40,797 INFO L93 Difference]: Finished difference Result 26365 states and 78725 transitions. [2019-12-27 15:34:40,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:34:40,798 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 15:34:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:40,827 INFO L225 Difference]: With dead ends: 26365 [2019-12-27 15:34:40,827 INFO L226 Difference]: Without dead ends: 23490 [2019-12-27 15:34:40,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:34:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states. [2019-12-27 15:34:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 18659. [2019-12-27 15:34:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18659 states. [2019-12-27 15:34:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18659 states to 18659 states and 56399 transitions. [2019-12-27 15:34:41,146 INFO L78 Accepts]: Start accepts. Automaton has 18659 states and 56399 transitions. Word has length 67 [2019-12-27 15:34:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:41,146 INFO L462 AbstractCegarLoop]: Abstraction has 18659 states and 56399 transitions. [2019-12-27 15:34:41,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 15:34:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 18659 states and 56399 transitions. [2019-12-27 15:34:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:34:41,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:41,165 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 15:34:41,166 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 15:34:41,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 4 times [2019-12-27 15:34:41,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:41,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314929301] [2019-12-27 15:34:41,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:41,524 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 15:34:41,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314929301] [2019-12-27 15:34:41,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:41,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 15:34:41,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1495607105] [2019-12-27 15:34:41,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:41,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:41,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 312 states and 635 transitions. [2019-12-27 15:34:41,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:42,814 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-27 15:34:43,419 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2019-12-27 15:34:43,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-12-27 15:34:43,830 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-27 15:34:43,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 15:34:43,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:34:43,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:34:43,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 15:34:43,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 15:34:43,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:43,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 15:34:43,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:34:43,891 INFO L87 Difference]: Start difference. First operand 18659 states and 56399 transitions. Second operand 26 states. [2019-12-27 15:35:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:35:01,719 INFO L93 Difference]: Finished difference Result 56099 states and 164851 transitions. [2019-12-27 15:35:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-27 15:35:01,719 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2019-12-27 15:35:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:35:01,778 INFO L225 Difference]: With dead ends: 56099 [2019-12-27 15:35:01,778 INFO L226 Difference]: Without dead ends: 46674 [2019-12-27 15:35:01,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1228, Invalid=7514, Unknown=0, NotChecked=0, Total=8742 [2019-12-27 15:35:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46674 states. [2019-12-27 15:35:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46674 to 20566. [2019-12-27 15:35:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20566 states. [2019-12-27 15:35:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20566 states to 20566 states and 62018 transitions. [2019-12-27 15:35:02,280 INFO L78 Accepts]: Start accepts. Automaton has 20566 states and 62018 transitions. Word has length 67 [2019-12-27 15:35:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:35:02,280 INFO L462 AbstractCegarLoop]: Abstraction has 20566 states and 62018 transitions. [2019-12-27 15:35:02,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 15:35:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 20566 states and 62018 transitions. [2019-12-27 15:35:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:35:02,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:35:02,299 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 15:35:02,299 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 15:35:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:35:02,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1241758622, now seen corresponding path program 5 times [2019-12-27 15:35:02,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:35:02,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708112981] [2019-12-27 15:35:02,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:35:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:35:02,472 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 15:35:02,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708112981] [2019-12-27 15:35:02,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:35:02,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:35:02,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046500514] [2019-12-27 15:35:02,473 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:35:02,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:35:02,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 518 transitions. [2019-12-27 15:35:02,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:35:03,235 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 15:35:03,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:35:03,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:35:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:35:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:35:03,237 INFO L87 Difference]: Start difference. First operand 20566 states and 62018 transitions. Second operand 15 states. [2019-12-27 15:35:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:35:09,612 INFO L93 Difference]: Finished difference Result 57435 states and 172420 transitions. [2019-12-27 15:35:09,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-27 15:35:09,613 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 15:35:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:35:09,682 INFO L225 Difference]: With dead ends: 57435 [2019-12-27 15:35:09,682 INFO L226 Difference]: Without dead ends: 52090 [2019-12-27 15:35:09,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=823, Invalid=4007, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 15:35:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52090 states. [2019-12-27 15:35:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52090 to 23920. [2019-12-27 15:35:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23920 states. [2019-12-27 15:35:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23920 states to 23920 states and 72201 transitions. [2019-12-27 15:35:10,261 INFO L78 Accepts]: Start accepts. Automaton has 23920 states and 72201 transitions. Word has length 67 [2019-12-27 15:35:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:35:10,261 INFO L462 AbstractCegarLoop]: Abstraction has 23920 states and 72201 transitions. [2019-12-27 15:35:10,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:35:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 23920 states and 72201 transitions. [2019-12-27 15:35:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:35:10,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:35:10,287 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 15:35:10,287 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 15:35:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:35:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1213952882, now seen corresponding path program 6 times [2019-12-27 15:35:10,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:35:10,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256916010] [2019-12-27 15:35:10,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:35:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:35:10,439 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 15:35:10,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256916010] [2019-12-27 15:35:10,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:35:10,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:35:10,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536719687] [2019-12-27 15:35:10,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:35:10,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:35:10,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 334 states and 691 transitions. [2019-12-27 15:35:10,689 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:35:11,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 15:35:11,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 15:35:11,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:35:11,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 15:35:11,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:35:11,138 INFO L87 Difference]: Start difference. First operand 23920 states and 72201 transitions. Second operand 16 states. [2019-12-27 15:35:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:35:17,202 INFO L93 Difference]: Finished difference Result 55231 states and 164396 transitions. [2019-12-27 15:35:17,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 15:35:17,202 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 15:35:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:35:17,266 INFO L225 Difference]: With dead ends: 55231 [2019-12-27 15:35:17,266 INFO L226 Difference]: Without dead ends: 48645 [2019-12-27 15:35:17,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=688, Invalid=2852, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 15:35:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48645 states. [2019-12-27 15:35:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48645 to 19323. [2019-12-27 15:35:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19323 states. [2019-12-27 15:35:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19323 states to 19323 states and 58301 transitions. [2019-12-27 15:35:17,760 INFO L78 Accepts]: Start accepts. Automaton has 19323 states and 58301 transitions. Word has length 67 [2019-12-27 15:35:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:35:17,760 INFO L462 AbstractCegarLoop]: Abstraction has 19323 states and 58301 transitions. [2019-12-27 15:35:17,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 15:35:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 19323 states and 58301 transitions. [2019-12-27 15:35:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:35:17,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:35:17,778 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 15:35:17,778 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 15:35:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:35:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 7 times [2019-12-27 15:35:17,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:35:17,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908704412] [2019-12-27 15:35:17,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:35:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:35:17,960 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 15:35:17,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908704412] [2019-12-27 15:35:17,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:35:17,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:35:17,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [93596914] [2019-12-27 15:35:17,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:35:17,983 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:35:18,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 311 states and 628 transitions. [2019-12-27 15:35:18,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:35:18,528 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 15:35:18,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:35:18,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:35:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:35:18,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:35:18,529 INFO L87 Difference]: Start difference. First operand 19323 states and 58301 transitions. Second operand 13 states. [2019-12-27 15:35:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:35:19,682 INFO L93 Difference]: Finished difference Result 32472 states and 96694 transitions. [2019-12-27 15:35:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:35:19,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 15:35:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:35:19,725 INFO L225 Difference]: With dead ends: 32472 [2019-12-27 15:35:19,726 INFO L226 Difference]: Without dead ends: 32241 [2019-12-27 15:35:19,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:35:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32241 states. [2019-12-27 15:35:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32241 to 19147. [2019-12-27 15:35:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19147 states. [2019-12-27 15:35:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19147 states to 19147 states and 57829 transitions. [2019-12-27 15:35:20,104 INFO L78 Accepts]: Start accepts. Automaton has 19147 states and 57829 transitions. Word has length 67 [2019-12-27 15:35:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:35:20,104 INFO L462 AbstractCegarLoop]: Abstraction has 19147 states and 57829 transitions. [2019-12-27 15:35:20,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:35:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 19147 states and 57829 transitions. [2019-12-27 15:35:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:35:20,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:35:20,123 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 15:35:20,123 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 15:35:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:35:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 8 times [2019-12-27 15:35:20,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:35:20,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453207719] [2019-12-27 15:35:20,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:35:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:35:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:35:20,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:35:20,230 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:35:20,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$r_buff0_thd2~0_185 0) (= 0 |v_ULTIMATE.start_main_~#t74~0.offset_23|) (= 0 v_~x~0_134) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t74~0.base_32|)) (= v_~z$r_buff1_thd0~0_195 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t74~0.base_32| 1)) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t74~0.base_32|) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t74~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t74~0.base_32|) |v_ULTIMATE.start_main_~#t74~0.offset_23| 0)) |v_#memory_int_21|) (= v_~z$w_buff1~0_222 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t74~0.base_32| 4)) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t75~0.offset=|v_ULTIMATE.start_main_~#t75~0.offset_22|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t76~0.base=|v_ULTIMATE.start_main_~#t76~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t76~0.offset=|v_ULTIMATE.start_main_~#t76~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ULTIMATE.start_main_~#t75~0.base=|v_ULTIMATE.start_main_~#t75~0.base_29|, ULTIMATE.start_main_~#t74~0.offset=|v_ULTIMATE.start_main_~#t74~0.offset_23|, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t74~0.base=|v_ULTIMATE.start_main_~#t74~0.base_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t75~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t76~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t76~0.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t75~0.base, ULTIMATE.start_main_~#t74~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t74~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:35:20,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In446309004)) (= ~z$r_buff1_thd0~0_Out446309004 ~z$r_buff0_thd0~0_In446309004) (= ~x~0_In446309004 ~__unbuffered_p0_EAX~0_Out446309004) (= ~z$r_buff0_thd3~0_In446309004 ~z$r_buff1_thd3~0_Out446309004) (= ~z$r_buff1_thd2~0_Out446309004 ~z$r_buff0_thd2~0_In446309004) (= 1 ~z$r_buff0_thd1~0_Out446309004) (= ~z$r_buff0_thd1~0_In446309004 ~z$r_buff1_thd1~0_Out446309004)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In446309004, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In446309004, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In446309004, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In446309004, ~x~0=~x~0_In446309004, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In446309004} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out446309004, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In446309004, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out446309004, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out446309004, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out446309004, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out446309004, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In446309004, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In446309004, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out446309004, ~x~0=~x~0_In446309004, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In446309004} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:35:20,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t75~0.base_11| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t75~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t75~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t75~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t75~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t75~0.base_11|) |v_ULTIMATE.start_main_~#t75~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t75~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t75~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t75~0.offset=|v_ULTIMATE.start_main_~#t75~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t75~0.base=|v_ULTIMATE.start_main_~#t75~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t75~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t75~0.base, #length] because there is no mapped edge [2019-12-27 15:35:20,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-765086279| |P1Thread1of1ForFork2_#t~ite10_Out-765086279|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-765086279 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-765086279 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-765086279| ~z~0_In-765086279)) (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-765086279| ~z$w_buff1~0_In-765086279)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-765086279, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-765086279, ~z$w_buff1~0=~z$w_buff1~0_In-765086279, ~z~0=~z~0_In-765086279} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-765086279|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-765086279, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-765086279|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-765086279, ~z$w_buff1~0=~z$w_buff1~0_In-765086279, ~z~0=~z~0_In-765086279} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 15:35:20,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In992369688 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In992369688 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out992369688| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out992369688| ~z$w_buff0_used~0_In992369688)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In992369688, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In992369688} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In992369688, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out992369688|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In992369688} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 15:35:20,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t76~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t76~0.base_11|) |v_ULTIMATE.start_main_~#t76~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t76~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t76~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t76~0.base_11|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t76~0.base_11| 4) |v_#length_15|) (= |v_ULTIMATE.start_main_~#t76~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t76~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t76~0.offset=|v_ULTIMATE.start_main_~#t76~0.offset_10|, ULTIMATE.start_main_~#t76~0.base=|v_ULTIMATE.start_main_~#t76~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t76~0.offset, ULTIMATE.start_main_~#t76~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 15:35:20,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-475508036 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-475508036 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-475508036 |P0Thread1of1ForFork1_#t~ite5_Out-475508036|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-475508036| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-475508036, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-475508036} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-475508036|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-475508036, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-475508036} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 15:35:20,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In393061378 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In393061378 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In393061378 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In393061378 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out393061378| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In393061378 |P0Thread1of1ForFork1_#t~ite6_Out393061378|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In393061378, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In393061378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In393061378, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In393061378} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In393061378, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out393061378|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In393061378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In393061378, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In393061378} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:35:20,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1101561590 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1101561590 256)))) (or (and (= ~z$r_buff0_thd1~0_Out1101561590 ~z$r_buff0_thd1~0_In1101561590) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1101561590) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1101561590, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1101561590} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1101561590, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1101561590|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1101561590} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:35:20,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In-2122300810 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2122300810 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-2122300810 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2122300810 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-2122300810| ~z$r_buff1_thd1~0_In-2122300810)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-2122300810|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2122300810, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2122300810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2122300810, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2122300810} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2122300810|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2122300810, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2122300810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2122300810, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2122300810} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 15:35:20,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 15:35:20,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-322727325 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-322727325 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-322727325 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-322727325 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-322727325| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out-322727325| ~z$w_buff1_used~0_In-322727325) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-322727325, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-322727325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-322727325, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-322727325} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-322727325, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-322727325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-322727325, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-322727325|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-322727325} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 15:35:20,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1977051447 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1977051447 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1977051447|)) (and (= ~z$r_buff0_thd2~0_In1977051447 |P1Thread1of1ForFork2_#t~ite13_Out1977051447|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1977051447, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1977051447} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1977051447, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1977051447|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1977051447} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 15:35:20,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In318803611 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In318803611 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In318803611 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In318803611 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out318803611| 0)) (and (= ~z$r_buff1_thd2~0_In318803611 |P1Thread1of1ForFork2_#t~ite14_Out318803611|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In318803611, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In318803611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In318803611, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In318803611} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In318803611, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In318803611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In318803611, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out318803611|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In318803611} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 15:35:20,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 15:35:20,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2030956385 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out2030956385| |P2Thread1of1ForFork0_#t~ite29_Out2030956385|) .cse0 (= ~z$w_buff1_used~0_In2030956385 |P2Thread1of1ForFork0_#t~ite29_Out2030956385|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2030956385 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In2030956385 256) 0) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In2030956385 256))) (= 0 (mod ~z$w_buff0_used~0_In2030956385 256))))) (and (not .cse0) (= ~z$w_buff1_used~0_In2030956385 |P2Thread1of1ForFork0_#t~ite30_Out2030956385|) (= |P2Thread1of1ForFork0_#t~ite29_In2030956385| |P2Thread1of1ForFork0_#t~ite29_Out2030956385|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2030956385, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2030956385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2030956385, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2030956385, ~weak$$choice2~0=~weak$$choice2~0_In2030956385, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In2030956385|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2030956385, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2030956385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2030956385, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2030956385, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out2030956385|, ~weak$$choice2~0=~weak$$choice2~0_In2030956385, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out2030956385|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 15:35:20,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 15:35:20,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 15:35:20,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-854383022 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-854383022 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-854383022| ~z$w_buff1~0_In-854383022)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-854383022| ~z~0_In-854383022)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-854383022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-854383022, ~z$w_buff1~0=~z$w_buff1~0_In-854383022, ~z~0=~z~0_In-854383022} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-854383022|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-854383022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-854383022, ~z$w_buff1~0=~z$w_buff1~0_In-854383022, ~z~0=~z~0_In-854383022} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:35:20,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 15:35:20,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-717520132 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-717520132 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-717520132| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-717520132| ~z$w_buff0_used~0_In-717520132) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-717520132, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-717520132} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-717520132, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-717520132|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-717520132} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 15:35:20,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1215110855 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1215110855 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1215110855 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1215110855 256) 0))) (or (and (= ~z$w_buff1_used~0_In1215110855 |P2Thread1of1ForFork0_#t~ite41_Out1215110855|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1215110855|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1215110855, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1215110855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1215110855, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1215110855} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1215110855, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1215110855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1215110855, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1215110855, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1215110855|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 15:35:20,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1836709461 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1836709461 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1836709461| ~z$r_buff0_thd3~0_In-1836709461)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1836709461| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1836709461, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1836709461} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1836709461, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1836709461, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1836709461|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:35:20,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-271825267 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-271825267 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-271825267 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-271825267 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-271825267| 0)) (and (= ~z$r_buff1_thd3~0_In-271825267 |P2Thread1of1ForFork0_#t~ite43_Out-271825267|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-271825267, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-271825267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-271825267, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-271825267} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-271825267|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-271825267, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-271825267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-271825267, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-271825267} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 15:35:20,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 15:35:20,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~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 15:35:20,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-175760873 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-175760873 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite47_Out-175760873| |ULTIMATE.start_main_#t~ite48_Out-175760873|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite47_Out-175760873| ~z$w_buff1~0_In-175760873) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite47_Out-175760873| ~z~0_In-175760873)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-175760873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-175760873, ~z$w_buff1~0=~z$w_buff1~0_In-175760873, ~z~0=~z~0_In-175760873} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-175760873, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-175760873|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-175760873, ~z$w_buff1~0=~z$w_buff1~0_In-175760873, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-175760873|, ~z~0=~z~0_In-175760873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:35:20,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1022380364 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1022380364 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1022380364 |ULTIMATE.start_main_#t~ite49_Out-1022380364|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1022380364| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1022380364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1022380364} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1022380364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1022380364, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1022380364|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:35:20,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-796424964 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-796424964 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-796424964 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-796424964 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-796424964| ~z$w_buff1_used~0_In-796424964)) (and (= |ULTIMATE.start_main_#t~ite50_Out-796424964| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-796424964, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-796424964, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-796424964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-796424964} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-796424964|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-796424964, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-796424964, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-796424964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-796424964} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:35:20,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1156775381 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1156775381 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1156775381 |ULTIMATE.start_main_#t~ite51_Out1156775381|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1156775381| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1156775381, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1156775381} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1156775381, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1156775381|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1156775381} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:35:20,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1479630207 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1479630207 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1479630207 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1479630207 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1479630207| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1479630207| ~z$r_buff1_thd0~0_In-1479630207) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1479630207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1479630207, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1479630207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1479630207} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1479630207|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1479630207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1479630207, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1479630207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1479630207} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:35:20,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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 15:35:20,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:35:20 BasicIcfg [2019-12-27 15:35:20,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:35:20,356 INFO L168 Benchmark]: Toolchain (without parser) took 145785.54 ms. Allocated memory was 135.3 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 98.2 MB in the beginning and 1.0 GB in the end (delta: -946.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 15:35:20,357 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 15:35:20,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.45 ms. Allocated memory was 135.3 MB in the beginning and 199.8 MB in the end (delta: 64.5 MB). Free memory was 97.8 MB in the beginning and 152.7 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:20,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.10 ms. Allocated memory is still 199.8 MB. Free memory was 152.7 MB in the beginning and 150.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:20,358 INFO L168 Benchmark]: Boogie Preprocessor took 38.82 ms. Allocated memory is still 199.8 MB. Free memory was 150.5 MB in the beginning and 147.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:20,359 INFO L168 Benchmark]: RCFGBuilder took 852.99 ms. Allocated memory is still 199.8 MB. Free memory was 147.6 MB in the beginning and 96.4 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:20,359 INFO L168 Benchmark]: TraceAbstraction took 144043.36 ms. Allocated memory was 199.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 96.4 MB in the beginning and 1.0 GB in the end (delta: -947.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 15:35:20,362 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.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.45 ms. Allocated memory was 135.3 MB in the beginning and 199.8 MB in the end (delta: 64.5 MB). Free memory was 97.8 MB in the beginning and 152.7 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.10 ms. Allocated memory is still 199.8 MB. Free memory was 152.7 MB in the beginning and 150.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.82 ms. Allocated memory is still 199.8 MB. Free memory was 150.5 MB in the beginning and 147.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.99 ms. Allocated memory is still 199.8 MB. Free memory was 147.6 MB in the beginning and 96.4 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144043.36 ms. Allocated memory was 199.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 96.4 MB in the beginning and 1.0 GB in the end (delta: -947.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t74, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L834] FCALL, FORK 0 pthread_create(&t75, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=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 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L773] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L750] 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) [L773] 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) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t76, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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_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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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] 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) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 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 [L775] 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 [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 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)) [L799] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 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)) [L800] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 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)) [L801] 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)) [L803] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 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)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 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 [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 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) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 143.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 62.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8491 SDtfs, 11487 SDslu, 37832 SDs, 0 SdLazy, 34433 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 732 GetRequests, 160 SyntacticMatches, 84 SemanticMatches, 488 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5987 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred 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: 41.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 374171 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1407 NumberOfCodeBlocks, 1407 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1309 ConstructedInterpolants, 0 QuantifiedInterpolants, 275159 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...