/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:23:17,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:23:17,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:23:17,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:23:17,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:23:17,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:23:17,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:23:17,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:23:17,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:23:17,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:23:17,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:23:17,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:23:17,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:23:17,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:23:17,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:23:17,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:23:17,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:23:17,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:23:17,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:23:17,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:23:17,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:23:17,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:23:17,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:23:17,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:23:17,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:23:17,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:23:17,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:23:17,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:23:17,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:23:17,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:23:17,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:23:17,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:23:17,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:23:17,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:23:17,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:23:17,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:23:17,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:23:17,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:23:17,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:23:17,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:23:17,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:23:17,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:23:17,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:23:17,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:23:17,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:23:17,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:23:17,420 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:23:17,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:23:17,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:23:17,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:23:17,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:23:17,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:23:17,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:23:17,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:23:17,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:23:17,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:23:17,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:23:17,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:23:17,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:23:17,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:23:17,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:23:17,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:23:17,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:23:17,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:23:17,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:23:17,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:23:17,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:23:17,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:23:17,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:23:17,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:23:17,425 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:23:17,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:23:17,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:23:17,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:23:17,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:23:17,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:23:17,725 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:23:17,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2019-12-18 12:23:17,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09de31c5/a679a9e010e7483cabb4f464a919201d/FLAGe4cae2d2b [2019-12-18 12:23:18,346 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:23:18,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2019-12-18 12:23:18,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09de31c5/a679a9e010e7483cabb4f464a919201d/FLAGe4cae2d2b [2019-12-18 12:23:18,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09de31c5/a679a9e010e7483cabb4f464a919201d [2019-12-18 12:23:18,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:23:18,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:23:18,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:23:18,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:23:18,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:23:18,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:23:18" (1/1) ... [2019-12-18 12:23:18,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f54299f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:18, skipping insertion in model container [2019-12-18 12:23:18,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:23:18" (1/1) ... [2019-12-18 12:23:18,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:23:18,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:23:19,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:23:19,264 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:23:19,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:23:19,402 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:23:19,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19 WrapperNode [2019-12-18 12:23:19,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:23:19,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:23:19,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:23:19,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:23:19,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:23:19,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:23:19,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:23:19,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:23:19,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... [2019-12-18 12:23:19,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:23:19,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:23:19,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:23:19,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:23:19,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:23:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:23:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:23:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:23:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:23:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:23:19,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:23:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:23:19,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:23:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:23:19,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:23:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:23:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:23:19,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:23:19,598 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:23:20,318 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:23:20,319 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:23:20,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:23:20 BoogieIcfgContainer [2019-12-18 12:23:20,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:23:20,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:23:20,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:23:20,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:23:20,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:23:18" (1/3) ... [2019-12-18 12:23:20,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe1dc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:23:20, skipping insertion in model container [2019-12-18 12:23:20,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:19" (2/3) ... [2019-12-18 12:23:20,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe1dc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:23:20, skipping insertion in model container [2019-12-18 12:23:20,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:23:20" (3/3) ... [2019-12-18 12:23:20,329 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_pso.oepc.i [2019-12-18 12:23:20,339 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:23:20,340 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:23:20,348 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:23:20,349 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:23:20,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,391 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,400 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,401 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,425 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,426 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,453 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,455 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,462 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,462 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:20,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:23:20,514 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:23:20,514 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:23:20,514 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:23:20,514 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:23:20,514 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:23:20,514 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:23:20,515 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:23:20,515 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:23:20,532 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 12:23:20,533 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:23:20,622 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:23:20,622 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:23:20,642 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:23:20,670 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:23:20,725 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:23:20,726 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:23:20,742 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:23:20,765 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:23:20,767 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:23:25,784 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 12:23:26,092 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:23:26,238 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:23:26,268 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-18 12:23:26,268 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 12:23:26,272 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-18 12:23:46,714 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 12:23:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 12:23:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:23:46,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:23:46,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:23:46,724 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-18 12:23:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:23:46,729 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-18 12:23:46,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:23:46,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253309721] [2019-12-18 12:23:46,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:23:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:23:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:23:47,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253309721] [2019-12-18 12:23:47,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:23:47,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:23:47,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071480594] [2019-12-18 12:23:47,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:23:47,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:23:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:23:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:23:47,033 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 12:23:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:23:50,978 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-18 12:23:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:23:50,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:23:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:23:51,595 INFO L225 Difference]: With dead ends: 125226 [2019-12-18 12:23:51,596 INFO L226 Difference]: Without dead ends: 117946 [2019-12-18 12:23:51,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:23:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-18 12:24:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-18 12:24:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-18 12:24:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-18 12:24:01,657 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-18 12:24:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:01,657 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-18 12:24:01,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-18 12:24:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:24:01,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:01,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:01,662 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-18 12:24:01,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:01,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-18 12:24:01,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:01,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835258571] [2019-12-18 12:24:01,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:01,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835258571] [2019-12-18 12:24:01,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:01,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:24:01,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458411473] [2019-12-18 12:24:01,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:24:01,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:01,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:24:01,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:24:01,760 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-18 12:24:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:07,003 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-18 12:24:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:24:07,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:24:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:07,616 INFO L225 Difference]: With dead ends: 183040 [2019-12-18 12:24:07,616 INFO L226 Difference]: Without dead ends: 182991 [2019-12-18 12:24:07,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-18 12:24:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-18 12:24:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-18 12:24:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-18 12:24:26,603 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-18 12:24:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:26,603 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-18 12:24:26,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:24:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-18 12:24:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:24:26,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:26,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:26,610 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-18 12:24:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:26,611 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-18 12:24:26,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:26,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853970993] [2019-12-18 12:24:26,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:26,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853970993] [2019-12-18 12:24:26,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:26,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:24:26,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294283469] [2019-12-18 12:24:26,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:26,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:26,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:26,678 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-18 12:24:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:26,826 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-18 12:24:26,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:26,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:24:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:26,927 INFO L225 Difference]: With dead ends: 35531 [2019-12-18 12:24:26,928 INFO L226 Difference]: Without dead ends: 35531 [2019-12-18 12:24:26,928 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-18 12:24:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-18 12:24:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-18 12:24:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 12:24:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-18 12:24:27,621 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-18 12:24:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:27,621 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-18 12:24:27,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-18 12:24:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:24:27,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:27,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:27,625 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-18 12:24:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-18 12:24:27,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:27,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798675405] [2019-12-18 12:24:27,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:27,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798675405] [2019-12-18 12:24:27,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:27,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:27,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962508294] [2019-12-18 12:24:27,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:27,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:27,770 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-18 12:24:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:28,356 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-18 12:24:28,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:24:28,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:24:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:29,884 INFO L225 Difference]: With dead ends: 49606 [2019-12-18 12:24:29,884 INFO L226 Difference]: Without dead ends: 49606 [2019-12-18 12:24:29,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-18 12:24:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-18 12:24:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-18 12:24:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-18 12:24:30,710 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-18 12:24:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:30,711 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-18 12:24:30,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-18 12:24:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:24:30,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:30,723 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-18 12:24:30,723 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-18 12:24:30,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:30,723 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-18 12:24:30,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:30,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454026497] [2019-12-18 12:24:30,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:30,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454026497] [2019-12-18 12:24:30,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:30,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:24:30,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087509929] [2019-12-18 12:24:30,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:24:30,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:30,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:24:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:30,887 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 7 states. [2019-12-18 12:24:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:31,915 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-18 12:24:31,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:24:31,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 12:24:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:32,038 INFO L225 Difference]: With dead ends: 68217 [2019-12-18 12:24:32,038 INFO L226 Difference]: Without dead ends: 68203 [2019-12-18 12:24:32,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:24:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-18 12:24:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-18 12:24:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-18 12:24:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-18 12:24:35,662 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-18 12:24:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:35,663 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-18 12:24:35,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:24:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-18 12:24:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:24:35,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:35,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:35,679 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-18 12:24:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-18 12:24:35,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:35,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505042515] [2019-12-18 12:24:35,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:35,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-18 12:24:35,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505042515] [2019-12-18 12:24:35,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:35,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:35,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114811260] [2019-12-18 12:24:35,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:24:35,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:35,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:24:35,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:24:35,733 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 4 states. [2019-12-18 12:24:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:35,809 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-18 12:24:35,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:24:35,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:24:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:35,832 INFO L225 Difference]: With dead ends: 16636 [2019-12-18 12:24:35,832 INFO L226 Difference]: Without dead ends: 16636 [2019-12-18 12:24:35,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:24:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-18 12:24:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-18 12:24:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-18 12:24:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-18 12:24:36,083 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-18 12:24:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:36,083 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-18 12:24:36,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:24:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-18 12:24:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:24:36,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:36,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:36,095 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-18 12:24:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-18 12:24:36,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:36,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117915083] [2019-12-18 12:24:36,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:36,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117915083] [2019-12-18 12:24:36,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:36,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:24:36,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683947696] [2019-12-18 12:24:36,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:24:36,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:24:36,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:24:36,171 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-18 12:24:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:36,717 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-18 12:24:36,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:24:36,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:24:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:36,753 INFO L225 Difference]: With dead ends: 23754 [2019-12-18 12:24:36,753 INFO L226 Difference]: Without dead ends: 23754 [2019-12-18 12:24:36,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:24:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-18 12:24:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-18 12:24:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-18 12:24:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-18 12:24:37,378 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-18 12:24:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:37,378 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-18 12:24:37,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:24:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-18 12:24:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:24:37,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:37,399 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-18 12:24:37,399 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-18 12:24:37,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:37,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-18 12:24:37,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:37,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235098524] [2019-12-18 12:24:37,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:37,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235098524] [2019-12-18 12:24:37,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:37,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:37,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873095739] [2019-12-18 12:24:37,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:37,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:37,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:37,484 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 5 states. [2019-12-18 12:24:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:37,887 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-18 12:24:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:24:37,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 12:24:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:37,920 INFO L225 Difference]: With dead ends: 23902 [2019-12-18 12:24:37,921 INFO L226 Difference]: Without dead ends: 23902 [2019-12-18 12:24:37,921 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-18 12:24:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-18 12:24:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-18 12:24:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-18 12:24:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-18 12:24:38,240 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-18 12:24:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:38,240 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-18 12:24:38,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-18 12:24:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:24:38,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:38,263 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-18 12:24:38,264 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-18 12:24:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:38,264 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-18 12:24:38,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:38,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103860970] [2019-12-18 12:24:38,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:38,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103860970] [2019-12-18 12:24:38,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:38,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:24:38,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131166123] [2019-12-18 12:24:38,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:24:38,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:24:38,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:24:38,367 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 8 states. [2019-12-18 12:24:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:39,643 INFO L93 Difference]: Finished difference Result 27626 states and 80996 transitions. [2019-12-18 12:24:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:24:39,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:24:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:39,683 INFO L225 Difference]: With dead ends: 27626 [2019-12-18 12:24:39,683 INFO L226 Difference]: Without dead ends: 27626 [2019-12-18 12:24:39,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:24:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27626 states. [2019-12-18 12:24:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27626 to 17400. [2019-12-18 12:24:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-12-18 12:24:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 52480 transitions. [2019-12-18 12:24:40,306 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 52480 transitions. Word has length 33 [2019-12-18 12:24:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:40,306 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 52480 transitions. [2019-12-18 12:24:40,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:24:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 52480 transitions. [2019-12-18 12:24:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:24:40,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:40,327 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-18 12:24:40,328 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-18 12:24:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-18 12:24:40,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:40,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140272824] [2019-12-18 12:24:40,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:40,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140272824] [2019-12-18 12:24:40,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:40,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:24:40,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625391578] [2019-12-18 12:24:40,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:40,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:40,389 INFO L87 Difference]: Start difference. First operand 17400 states and 52480 transitions. Second operand 3 states. [2019-12-18 12:24:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:40,467 INFO L93 Difference]: Finished difference Result 17399 states and 52478 transitions. [2019-12-18 12:24:40,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:40,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:24:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:40,503 INFO L225 Difference]: With dead ends: 17399 [2019-12-18 12:24:40,503 INFO L226 Difference]: Without dead ends: 17399 [2019-12-18 12:24:40,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2019-12-18 12:24:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 17399. [2019-12-18 12:24:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17399 states. [2019-12-18 12:24:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17399 states to 17399 states and 52478 transitions. [2019-12-18 12:24:40,874 INFO L78 Accepts]: Start accepts. Automaton has 17399 states and 52478 transitions. Word has length 39 [2019-12-18 12:24:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:40,874 INFO L462 AbstractCegarLoop]: Abstraction has 17399 states and 52478 transitions. [2019-12-18 12:24:40,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 17399 states and 52478 transitions. [2019-12-18 12:24:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:24:40,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:40,893 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-18 12:24:40,893 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-18 12:24:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-18 12:24:40,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:40,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078806300] [2019-12-18 12:24:40,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:40,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078806300] [2019-12-18 12:24:40,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:40,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:24:40,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326450389] [2019-12-18 12:24:40,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:24:40,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:40,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:24:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:24:40,985 INFO L87 Difference]: Start difference. First operand 17399 states and 52478 transitions. Second operand 6 states. [2019-12-18 12:24:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:41,904 INFO L93 Difference]: Finished difference Result 34243 states and 103303 transitions. [2019-12-18 12:24:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:24:41,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 12:24:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:41,954 INFO L225 Difference]: With dead ends: 34243 [2019-12-18 12:24:41,955 INFO L226 Difference]: Without dead ends: 34243 [2019-12-18 12:24:41,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:24:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2019-12-18 12:24:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 22015. [2019-12-18 12:24:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22015 states. [2019-12-18 12:24:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 66470 transitions. [2019-12-18 12:24:42,376 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 66470 transitions. Word has length 40 [2019-12-18 12:24:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:42,376 INFO L462 AbstractCegarLoop]: Abstraction has 22015 states and 66470 transitions. [2019-12-18 12:24:42,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:24:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 66470 transitions. [2019-12-18 12:24:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:24:42,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:42,401 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-18 12:24:42,401 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-18 12:24:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-18 12:24:42,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:42,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692291803] [2019-12-18 12:24:42,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:42,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692291803] [2019-12-18 12:24:42,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:42,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:24:42,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682578941] [2019-12-18 12:24:42,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:42,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:42,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:42,665 INFO L87 Difference]: Start difference. First operand 22015 states and 66470 transitions. Second operand 5 states. [2019-12-18 12:24:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:43,285 INFO L93 Difference]: Finished difference Result 30046 states and 90242 transitions. [2019-12-18 12:24:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:24:43,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:24:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:43,328 INFO L225 Difference]: With dead ends: 30046 [2019-12-18 12:24:43,329 INFO L226 Difference]: Without dead ends: 30046 [2019-12-18 12:24:43,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:24:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30046 states. [2019-12-18 12:24:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30046 to 26807. [2019-12-18 12:24:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-18 12:24:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81221 transitions. [2019-12-18 12:24:43,759 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81221 transitions. Word has length 40 [2019-12-18 12:24:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:43,759 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81221 transitions. [2019-12-18 12:24:43,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81221 transitions. [2019-12-18 12:24:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:24:43,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:43,795 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-18 12:24:43,795 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-18 12:24:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:43,796 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-18 12:24:43,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:43,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592775294] [2019-12-18 12:24:43,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:43,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592775294] [2019-12-18 12:24:43,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:43,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:24:43,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041159368] [2019-12-18 12:24:43,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:43,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:43,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:43,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:43,861 INFO L87 Difference]: Start difference. First operand 26807 states and 81221 transitions. Second operand 5 states. [2019-12-18 12:24:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:43,991 INFO L93 Difference]: Finished difference Result 25470 states and 78136 transitions. [2019-12-18 12:24:43,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:24:43,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:24:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:44,041 INFO L225 Difference]: With dead ends: 25470 [2019-12-18 12:24:44,042 INFO L226 Difference]: Without dead ends: 25470 [2019-12-18 12:24:44,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 12:24:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25470 states. [2019-12-18 12:24:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25470 to 24504. [2019-12-18 12:24:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-18 12:24:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 75530 transitions. [2019-12-18 12:24:44,437 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 75530 transitions. Word has length 40 [2019-12-18 12:24:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:44,437 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 75530 transitions. [2019-12-18 12:24:44,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 75530 transitions. [2019-12-18 12:24:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:44,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:44,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:44,469 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-18 12:24:44,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash 974609302, now seen corresponding path program 1 times [2019-12-18 12:24:44,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:44,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79024916] [2019-12-18 12:24:44,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:44,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79024916] [2019-12-18 12:24:44,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:44,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:44,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255959119] [2019-12-18 12:24:44,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:44,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:44,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:44,520 INFO L87 Difference]: Start difference. First operand 24504 states and 75530 transitions. Second operand 3 states. [2019-12-18 12:24:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:44,792 INFO L93 Difference]: Finished difference Result 34625 states and 106821 transitions. [2019-12-18 12:24:44,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:44,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:24:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:44,836 INFO L225 Difference]: With dead ends: 34625 [2019-12-18 12:24:44,836 INFO L226 Difference]: Without dead ends: 34625 [2019-12-18 12:24:44,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34625 states. [2019-12-18 12:24:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34625 to 27128. [2019-12-18 12:24:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27128 states. [2019-12-18 12:24:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27128 states to 27128 states and 84304 transitions. [2019-12-18 12:24:45,302 INFO L78 Accepts]: Start accepts. Automaton has 27128 states and 84304 transitions. Word has length 64 [2019-12-18 12:24:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:45,302 INFO L462 AbstractCegarLoop]: Abstraction has 27128 states and 84304 transitions. [2019-12-18 12:24:45,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 27128 states and 84304 transitions. [2019-12-18 12:24:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:45,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:45,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:45,333 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-18 12:24:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-18 12:24:45,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:45,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851400482] [2019-12-18 12:24:45,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:45,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851400482] [2019-12-18 12:24:45,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:45,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:24:45,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440717303] [2019-12-18 12:24:45,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:24:45,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:45,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:24:45,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:45,431 INFO L87 Difference]: Start difference. First operand 27128 states and 84304 transitions. Second operand 7 states. [2019-12-18 12:24:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:46,016 INFO L93 Difference]: Finished difference Result 73273 states and 226524 transitions. [2019-12-18 12:24:46,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:24:46,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:24:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:46,116 INFO L225 Difference]: With dead ends: 73273 [2019-12-18 12:24:46,116 INFO L226 Difference]: Without dead ends: 55201 [2019-12-18 12:24:46,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:24:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55201 states. [2019-12-18 12:24:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55201 to 31445. [2019-12-18 12:24:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31445 states. [2019-12-18 12:24:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31445 states to 31445 states and 97708 transitions. [2019-12-18 12:24:47,030 INFO L78 Accepts]: Start accepts. Automaton has 31445 states and 97708 transitions. Word has length 64 [2019-12-18 12:24:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:47,031 INFO L462 AbstractCegarLoop]: Abstraction has 31445 states and 97708 transitions. [2019-12-18 12:24:47,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:24:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 31445 states and 97708 transitions. [2019-12-18 12:24:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:47,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:47,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:47,067 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-18 12:24:47,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-18 12:24:47,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:47,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683864779] [2019-12-18 12:24:47,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:47,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683864779] [2019-12-18 12:24:47,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:47,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:24:47,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804222953] [2019-12-18 12:24:47,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:24:47,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:47,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:24:47,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:47,150 INFO L87 Difference]: Start difference. First operand 31445 states and 97708 transitions. Second operand 7 states. [2019-12-18 12:24:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:47,715 INFO L93 Difference]: Finished difference Result 81140 states and 248111 transitions. [2019-12-18 12:24:47,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:24:47,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:24:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:47,811 INFO L225 Difference]: With dead ends: 81140 [2019-12-18 12:24:47,811 INFO L226 Difference]: Without dead ends: 57495 [2019-12-18 12:24:47,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:24:47,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57495 states. [2019-12-18 12:24:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57495 to 35246. [2019-12-18 12:24:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-12-18 12:24:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 109148 transitions. [2019-12-18 12:24:49,009 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 109148 transitions. Word has length 64 [2019-12-18 12:24:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:49,009 INFO L462 AbstractCegarLoop]: Abstraction has 35246 states and 109148 transitions. [2019-12-18 12:24:49,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:24:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 109148 transitions. [2019-12-18 12:24:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:49,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:49,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:49,050 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-18 12:24:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-18 12:24:49,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:49,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135555976] [2019-12-18 12:24:49,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:49,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135555976] [2019-12-18 12:24:49,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:49,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:24:49,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733035128] [2019-12-18 12:24:49,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:24:49,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:24:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:24:49,160 INFO L87 Difference]: Start difference. First operand 35246 states and 109148 transitions. Second operand 8 states. [2019-12-18 12:24:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:50,344 INFO L93 Difference]: Finished difference Result 98595 states and 302496 transitions. [2019-12-18 12:24:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:24:50,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 12:24:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:50,482 INFO L225 Difference]: With dead ends: 98595 [2019-12-18 12:24:50,483 INFO L226 Difference]: Without dead ends: 87943 [2019-12-18 12:24:50,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:24:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87943 states. [2019-12-18 12:24:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87943 to 35744. [2019-12-18 12:24:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35744 states. [2019-12-18 12:24:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35744 states to 35744 states and 111048 transitions. [2019-12-18 12:24:51,948 INFO L78 Accepts]: Start accepts. Automaton has 35744 states and 111048 transitions. Word has length 64 [2019-12-18 12:24:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:51,948 INFO L462 AbstractCegarLoop]: Abstraction has 35744 states and 111048 transitions. [2019-12-18 12:24:51,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:24:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 35744 states and 111048 transitions. [2019-12-18 12:24:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:51,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:51,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:51,987 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-18 12:24:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-18 12:24:51,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:51,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431667954] [2019-12-18 12:24:51,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:52,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431667954] [2019-12-18 12:24:52,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:52,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:24:52,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781001908] [2019-12-18 12:24:52,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:24:52,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:24:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:24:52,097 INFO L87 Difference]: Start difference. First operand 35744 states and 111048 transitions. Second operand 9 states. [2019-12-18 12:24:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:53,646 INFO L93 Difference]: Finished difference Result 119468 states and 363005 transitions. [2019-12-18 12:24:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:24:53,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:24:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:53,818 INFO L225 Difference]: With dead ends: 119468 [2019-12-18 12:24:53,819 INFO L226 Difference]: Without dead ends: 105156 [2019-12-18 12:24:53,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:24:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105156 states. [2019-12-18 12:24:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105156 to 35780. [2019-12-18 12:24:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35780 states. [2019-12-18 12:24:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 111205 transitions. [2019-12-18 12:24:55,277 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 111205 transitions. Word has length 64 [2019-12-18 12:24:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:55,278 INFO L462 AbstractCegarLoop]: Abstraction has 35780 states and 111205 transitions. [2019-12-18 12:24:55,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:24:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 111205 transitions. [2019-12-18 12:24:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:55,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:55,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:55,318 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-18 12:24:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:55,318 INFO L82 PathProgramCache]: Analyzing trace with hash 836129701, now seen corresponding path program 5 times [2019-12-18 12:24:55,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:55,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732697215] [2019-12-18 12:24:55,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:55,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732697215] [2019-12-18 12:24:55,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:55,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:24:55,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785241806] [2019-12-18 12:24:55,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:24:55,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:55,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:24:55,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:24:55,431 INFO L87 Difference]: Start difference. First operand 35780 states and 111205 transitions. Second operand 9 states. [2019-12-18 12:24:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:57,238 INFO L93 Difference]: Finished difference Result 131669 states and 399951 transitions. [2019-12-18 12:24:57,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:24:57,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:24:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:57,429 INFO L225 Difference]: With dead ends: 131669 [2019-12-18 12:24:57,429 INFO L226 Difference]: Without dead ends: 121803 [2019-12-18 12:24:57,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:24:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2019-12-18 12:24:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 35817. [2019-12-18 12:24:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35817 states. [2019-12-18 12:24:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35817 states to 35817 states and 111367 transitions. [2019-12-18 12:24:59,010 INFO L78 Accepts]: Start accepts. Automaton has 35817 states and 111367 transitions. Word has length 64 [2019-12-18 12:24:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:59,010 INFO L462 AbstractCegarLoop]: Abstraction has 35817 states and 111367 transitions. [2019-12-18 12:24:59,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:24:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 35817 states and 111367 transitions. [2019-12-18 12:24:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:24:59,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:59,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:59,051 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-18 12:24:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 6 times [2019-12-18 12:24:59,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:59,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902542405] [2019-12-18 12:24:59,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:59,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902542405] [2019-12-18 12:24:59,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:59,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:24:59,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183567077] [2019-12-18 12:24:59,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:59,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:59,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:59,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:59,116 INFO L87 Difference]: Start difference. First operand 35817 states and 111367 transitions. Second operand 3 states. [2019-12-18 12:24:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:59,320 INFO L93 Difference]: Finished difference Result 42547 states and 131537 transitions. [2019-12-18 12:24:59,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:59,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:24:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:59,384 INFO L225 Difference]: With dead ends: 42547 [2019-12-18 12:24:59,384 INFO L226 Difference]: Without dead ends: 42547 [2019-12-18 12:24:59,384 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-18 12:24:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2019-12-18 12:24:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 37071. [2019-12-18 12:24:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37071 states. [2019-12-18 12:25:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37071 states to 37071 states and 115326 transitions. [2019-12-18 12:25:00,005 INFO L78 Accepts]: Start accepts. Automaton has 37071 states and 115326 transitions. Word has length 64 [2019-12-18 12:25:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:00,006 INFO L462 AbstractCegarLoop]: Abstraction has 37071 states and 115326 transitions. [2019-12-18 12:25:00,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 37071 states and 115326 transitions. [2019-12-18 12:25:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:00,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:00,047 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-18 12:25:00,047 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-18 12:25:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-18 12:25:00,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:00,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502246374] [2019-12-18 12:25:00,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:00,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502246374] [2019-12-18 12:25:00,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:00,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:00,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144436112] [2019-12-18 12:25:00,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:25:00,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:00,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:25:00,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:25:00,135 INFO L87 Difference]: Start difference. First operand 37071 states and 115326 transitions. Second operand 8 states. [2019-12-18 12:25:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:01,529 INFO L93 Difference]: Finished difference Result 111740 states and 339408 transitions. [2019-12-18 12:25:01,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:25:01,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:25:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:01,685 INFO L225 Difference]: With dead ends: 111740 [2019-12-18 12:25:01,686 INFO L226 Difference]: Without dead ends: 99733 [2019-12-18 12:25:01,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:25:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2019-12-18 12:25:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 37073. [2019-12-18 12:25:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-12-18 12:25:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 115341 transitions. [2019-12-18 12:25:02,796 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 115341 transitions. Word has length 65 [2019-12-18 12:25:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:02,796 INFO L462 AbstractCegarLoop]: Abstraction has 37073 states and 115341 transitions. [2019-12-18 12:25:02,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:25:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 115341 transitions. [2019-12-18 12:25:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:02,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:02,840 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-18 12:25:02,840 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-18 12:25:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:02,840 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-18 12:25:02,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:02,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739761203] [2019-12-18 12:25:02,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:02,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739761203] [2019-12-18 12:25:02,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:02,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:02,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084028418] [2019-12-18 12:25:02,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:02,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:02,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:02,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:02,957 INFO L87 Difference]: Start difference. First operand 37073 states and 115341 transitions. Second operand 9 states. [2019-12-18 12:25:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:04,777 INFO L93 Difference]: Finished difference Result 134194 states and 407074 transitions. [2019-12-18 12:25:04,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:25:04,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:25:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:04,968 INFO L225 Difference]: With dead ends: 134194 [2019-12-18 12:25:04,968 INFO L226 Difference]: Without dead ends: 122325 [2019-12-18 12:25:04,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:25:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122325 states. [2019-12-18 12:25:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122325 to 37029. [2019-12-18 12:25:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-18 12:25:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 115116 transitions. [2019-12-18 12:25:06,262 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 115116 transitions. Word has length 65 [2019-12-18 12:25:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:06,262 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 115116 transitions. [2019-12-18 12:25:06,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 115116 transitions. [2019-12-18 12:25:06,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:06,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:06,302 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-18 12:25:06,302 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-18 12:25:06,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1293437306, now seen corresponding path program 3 times [2019-12-18 12:25:06,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:06,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369516230] [2019-12-18 12:25:06,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:06,663 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-18 12:25:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:06,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369516230] [2019-12-18 12:25:06,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:06,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:06,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855235543] [2019-12-18 12:25:06,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:06,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:06,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:06,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:06,706 INFO L87 Difference]: Start difference. First operand 37029 states and 115116 transitions. Second operand 9 states. [2019-12-18 12:25:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:08,676 INFO L93 Difference]: Finished difference Result 153077 states and 465403 transitions. [2019-12-18 12:25:08,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:25:08,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:25:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:08,876 INFO L225 Difference]: With dead ends: 153077 [2019-12-18 12:25:08,876 INFO L226 Difference]: Without dead ends: 125434 [2019-12-18 12:25:08,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:25:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125434 states. [2019-12-18 12:25:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125434 to 40153. [2019-12-18 12:25:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40153 states. [2019-12-18 12:25:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40153 states to 40153 states and 125039 transitions. [2019-12-18 12:25:10,758 INFO L78 Accepts]: Start accepts. Automaton has 40153 states and 125039 transitions. Word has length 65 [2019-12-18 12:25:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:10,758 INFO L462 AbstractCegarLoop]: Abstraction has 40153 states and 125039 transitions. [2019-12-18 12:25:10,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 40153 states and 125039 transitions. [2019-12-18 12:25:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:10,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:10,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:10,804 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-18 12:25:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:10,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-18 12:25:10,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:10,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817773317] [2019-12-18 12:25:10,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:10,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817773317] [2019-12-18 12:25:10,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:10,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:10,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204560473] [2019-12-18 12:25:10,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:10,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:10,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:10,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:10,895 INFO L87 Difference]: Start difference. First operand 40153 states and 125039 transitions. Second operand 7 states. [2019-12-18 12:25:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:11,979 INFO L93 Difference]: Finished difference Result 55596 states and 169227 transitions. [2019-12-18 12:25:11,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:25:11,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:25:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:12,065 INFO L225 Difference]: With dead ends: 55596 [2019-12-18 12:25:12,065 INFO L226 Difference]: Without dead ends: 55596 [2019-12-18 12:25:12,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55596 states. [2019-12-18 12:25:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55596 to 42525. [2019-12-18 12:25:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2019-12-18 12:25:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 131689 transitions. [2019-12-18 12:25:12,849 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 131689 transitions. Word has length 65 [2019-12-18 12:25:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:12,849 INFO L462 AbstractCegarLoop]: Abstraction has 42525 states and 131689 transitions. [2019-12-18 12:25:12,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 131689 transitions. [2019-12-18 12:25:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:12,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:12,900 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-18 12:25:12,900 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-18 12:25:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-18 12:25:12,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:12,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632280905] [2019-12-18 12:25:12,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:13,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632280905] [2019-12-18 12:25:13,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:13,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:13,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420316492] [2019-12-18 12:25:13,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:13,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:13,066 INFO L87 Difference]: Start difference. First operand 42525 states and 131689 transitions. Second operand 9 states. [2019-12-18 12:25:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:15,375 INFO L93 Difference]: Finished difference Result 66164 states and 202890 transitions. [2019-12-18 12:25:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:25:15,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:25:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:15,475 INFO L225 Difference]: With dead ends: 66164 [2019-12-18 12:25:15,475 INFO L226 Difference]: Without dead ends: 66164 [2019-12-18 12:25:15,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:25:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66164 states. [2019-12-18 12:25:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66164 to 41944. [2019-12-18 12:25:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41944 states. [2019-12-18 12:25:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41944 states to 41944 states and 130085 transitions. [2019-12-18 12:25:16,312 INFO L78 Accepts]: Start accepts. Automaton has 41944 states and 130085 transitions. Word has length 65 [2019-12-18 12:25:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:16,312 INFO L462 AbstractCegarLoop]: Abstraction has 41944 states and 130085 transitions. [2019-12-18 12:25:16,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 41944 states and 130085 transitions. [2019-12-18 12:25:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:16,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:16,364 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-18 12:25:16,364 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-18 12:25:16,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:16,364 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-18 12:25:16,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:16,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646100066] [2019-12-18 12:25:16,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:16,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646100066] [2019-12-18 12:25:16,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:16,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:16,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496541989] [2019-12-18 12:25:16,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:25:16,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:25:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:16,566 INFO L87 Difference]: Start difference. First operand 41944 states and 130085 transitions. Second operand 10 states. [2019-12-18 12:25:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:18,530 INFO L93 Difference]: Finished difference Result 59640 states and 180401 transitions. [2019-12-18 12:25:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:25:18,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:25:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:18,613 INFO L225 Difference]: With dead ends: 59640 [2019-12-18 12:25:18,613 INFO L226 Difference]: Without dead ends: 59640 [2019-12-18 12:25:18,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:25:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59640 states. [2019-12-18 12:25:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59640 to 45198. [2019-12-18 12:25:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45198 states. [2019-12-18 12:25:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45198 states to 45198 states and 139652 transitions. [2019-12-18 12:25:19,690 INFO L78 Accepts]: Start accepts. Automaton has 45198 states and 139652 transitions. Word has length 65 [2019-12-18 12:25:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:19,690 INFO L462 AbstractCegarLoop]: Abstraction has 45198 states and 139652 transitions. [2019-12-18 12:25:19,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:25:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 45198 states and 139652 transitions. [2019-12-18 12:25:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:19,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:19,738 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-18 12:25:19,738 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-18 12:25:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:19,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-18 12:25:19,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:19,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692049209] [2019-12-18 12:25:19,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:19,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692049209] [2019-12-18 12:25:19,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:19,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:19,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916375326] [2019-12-18 12:25:19,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:19,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:19,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:19,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:19,835 INFO L87 Difference]: Start difference. First operand 45198 states and 139652 transitions. Second operand 7 states. [2019-12-18 12:25:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:20,953 INFO L93 Difference]: Finished difference Result 65123 states and 200338 transitions. [2019-12-18 12:25:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:25:20,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:25:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:21,050 INFO L225 Difference]: With dead ends: 65123 [2019-12-18 12:25:21,051 INFO L226 Difference]: Without dead ends: 65123 [2019-12-18 12:25:21,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:25:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65123 states. [2019-12-18 12:25:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65123 to 44842. [2019-12-18 12:25:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44842 states. [2019-12-18 12:25:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44842 states to 44842 states and 138685 transitions. [2019-12-18 12:25:21,894 INFO L78 Accepts]: Start accepts. Automaton has 44842 states and 138685 transitions. Word has length 65 [2019-12-18 12:25:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:21,895 INFO L462 AbstractCegarLoop]: Abstraction has 44842 states and 138685 transitions. [2019-12-18 12:25:21,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 44842 states and 138685 transitions. [2019-12-18 12:25:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:21,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:21,945 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-18 12:25:21,945 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-18 12:25:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-18 12:25:21,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:21,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816328174] [2019-12-18 12:25:21,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:22,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816328174] [2019-12-18 12:25:22,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:22,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:25:22,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655006812] [2019-12-18 12:25:22,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:25:22,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:25:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:22,076 INFO L87 Difference]: Start difference. First operand 44842 states and 138685 transitions. Second operand 10 states. [2019-12-18 12:25:23,046 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-18 12:25:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:25,075 INFO L93 Difference]: Finished difference Result 67488 states and 206049 transitions. [2019-12-18 12:25:25,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 12:25:25,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:25:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:25,181 INFO L225 Difference]: With dead ends: 67488 [2019-12-18 12:25:25,181 INFO L226 Difference]: Without dead ends: 67488 [2019-12-18 12:25:25,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 12:25:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67488 states. [2019-12-18 12:25:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67488 to 42052. [2019-12-18 12:25:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42052 states. [2019-12-18 12:25:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42052 states to 42052 states and 130395 transitions. [2019-12-18 12:25:26,091 INFO L78 Accepts]: Start accepts. Automaton has 42052 states and 130395 transitions. Word has length 65 [2019-12-18 12:25:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:26,091 INFO L462 AbstractCegarLoop]: Abstraction has 42052 states and 130395 transitions. [2019-12-18 12:25:26,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:25:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 42052 states and 130395 transitions. [2019-12-18 12:25:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:26,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:26,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-18 12:25:26,140 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-18 12:25:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash 883167852, now seen corresponding path program 6 times [2019-12-18 12:25:26,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:26,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472333448] [2019-12-18 12:25:26,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:26,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472333448] [2019-12-18 12:25:26,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:26,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:26,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581145525] [2019-12-18 12:25:26,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:25:26,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:26,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:25:26,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:26,216 INFO L87 Difference]: Start difference. First operand 42052 states and 130395 transitions. Second operand 4 states. [2019-12-18 12:25:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:26,518 INFO L93 Difference]: Finished difference Result 42052 states and 130123 transitions. [2019-12-18 12:25:26,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:25:26,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:25:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:26,634 INFO L225 Difference]: With dead ends: 42052 [2019-12-18 12:25:26,635 INFO L226 Difference]: Without dead ends: 42052 [2019-12-18 12:25:26,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42052 states. [2019-12-18 12:25:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42052 to 40470. [2019-12-18 12:25:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40470 states. [2019-12-18 12:25:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40470 states to 40470 states and 125534 transitions. [2019-12-18 12:25:27,774 INFO L78 Accepts]: Start accepts. Automaton has 40470 states and 125534 transitions. Word has length 65 [2019-12-18 12:25:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:27,774 INFO L462 AbstractCegarLoop]: Abstraction has 40470 states and 125534 transitions. [2019-12-18 12:25:27,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:25:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 40470 states and 125534 transitions. [2019-12-18 12:25:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:27,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:27,820 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-18 12:25:27,820 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-18 12:25:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1521961444, now seen corresponding path program 4 times [2019-12-18 12:25:27,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:27,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329492627] [2019-12-18 12:25:27,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:27,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329492627] [2019-12-18 12:25:27,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:27,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:27,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063188141] [2019-12-18 12:25:27,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:27,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:27,868 INFO L87 Difference]: Start difference. First operand 40470 states and 125534 transitions. Second operand 3 states. [2019-12-18 12:25:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:28,016 INFO L93 Difference]: Finished difference Result 40469 states and 125532 transitions. [2019-12-18 12:25:28,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:28,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:25:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:28,074 INFO L225 Difference]: With dead ends: 40469 [2019-12-18 12:25:28,074 INFO L226 Difference]: Without dead ends: 40469 [2019-12-18 12:25:28,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40469 states. [2019-12-18 12:25:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40469 to 29661. [2019-12-18 12:25:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29661 states. [2019-12-18 12:25:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29661 states to 29661 states and 94832 transitions. [2019-12-18 12:25:28,654 INFO L78 Accepts]: Start accepts. Automaton has 29661 states and 94832 transitions. Word has length 65 [2019-12-18 12:25:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:28,654 INFO L462 AbstractCegarLoop]: Abstraction has 29661 states and 94832 transitions. [2019-12-18 12:25:28,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29661 states and 94832 transitions. [2019-12-18 12:25:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:28,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:28,691 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-18 12:25:28,691 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-18 12:25:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 392067852, now seen corresponding path program 1 times [2019-12-18 12:25:28,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:28,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231451383] [2019-12-18 12:25:28,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:28,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231451383] [2019-12-18 12:25:28,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:28,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:28,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937603345] [2019-12-18 12:25:28,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:28,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:28,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:28,755 INFO L87 Difference]: Start difference. First operand 29661 states and 94832 transitions. Second operand 3 states. [2019-12-18 12:25:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:28,866 INFO L93 Difference]: Finished difference Result 24378 states and 76492 transitions. [2019-12-18 12:25:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:28,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:25:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:28,922 INFO L225 Difference]: With dead ends: 24378 [2019-12-18 12:25:28,922 INFO L226 Difference]: Without dead ends: 24378 [2019-12-18 12:25:28,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24378 states. [2019-12-18 12:25:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24378 to 22094. [2019-12-18 12:25:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22094 states. [2019-12-18 12:25:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22094 states to 22094 states and 69094 transitions. [2019-12-18 12:25:29,587 INFO L78 Accepts]: Start accepts. Automaton has 22094 states and 69094 transitions. Word has length 66 [2019-12-18 12:25:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:29,587 INFO L462 AbstractCegarLoop]: Abstraction has 22094 states and 69094 transitions. [2019-12-18 12:25:29,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22094 states and 69094 transitions. [2019-12-18 12:25:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:25:29,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:29,626 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-18 12:25:29,626 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-18 12:25:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:29,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2062742571, now seen corresponding path program 1 times [2019-12-18 12:25:29,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:29,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301977837] [2019-12-18 12:25:29,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:29,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301977837] [2019-12-18 12:25:29,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:29,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:29,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112346916] [2019-12-18 12:25:29,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:29,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:29,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:29,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:29,727 INFO L87 Difference]: Start difference. First operand 22094 states and 69094 transitions. Second operand 9 states. [2019-12-18 12:25:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:31,378 INFO L93 Difference]: Finished difference Result 42939 states and 132861 transitions. [2019-12-18 12:25:31,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:25:31,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:25:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:31,430 INFO L225 Difference]: With dead ends: 42939 [2019-12-18 12:25:31,430 INFO L226 Difference]: Without dead ends: 35065 [2019-12-18 12:25:31,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:25:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35065 states. [2019-12-18 12:25:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35065 to 22778. [2019-12-18 12:25:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22778 states. [2019-12-18 12:25:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22778 states to 22778 states and 70805 transitions. [2019-12-18 12:25:32,037 INFO L78 Accepts]: Start accepts. Automaton has 22778 states and 70805 transitions. Word has length 67 [2019-12-18 12:25:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:32,037 INFO L462 AbstractCegarLoop]: Abstraction has 22778 states and 70805 transitions. [2019-12-18 12:25:32,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22778 states and 70805 transitions. [2019-12-18 12:25:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:25:32,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:32,062 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-18 12:25:32,062 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 2 times [2019-12-18 12:25:32,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:32,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952971226] [2019-12-18 12:25:32,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:32,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952971226] [2019-12-18 12:25:32,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:32,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:32,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528308884] [2019-12-18 12:25:32,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:25:32,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:32,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:25:32,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:32,235 INFO L87 Difference]: Start difference. First operand 22778 states and 70805 transitions. Second operand 10 states. [2019-12-18 12:25:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:33,275 INFO L93 Difference]: Finished difference Result 44683 states and 137584 transitions. [2019-12-18 12:25:33,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:25:33,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:25:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:33,335 INFO L225 Difference]: With dead ends: 44683 [2019-12-18 12:25:33,335 INFO L226 Difference]: Without dead ends: 42768 [2019-12-18 12:25:33,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:25:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42768 states. [2019-12-18 12:25:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42768 to 26032. [2019-12-18 12:25:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26032 states. [2019-12-18 12:25:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26032 states to 26032 states and 80627 transitions. [2019-12-18 12:25:33,858 INFO L78 Accepts]: Start accepts. Automaton has 26032 states and 80627 transitions. Word has length 67 [2019-12-18 12:25:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:33,858 INFO L462 AbstractCegarLoop]: Abstraction has 26032 states and 80627 transitions. [2019-12-18 12:25:33,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:25:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 26032 states and 80627 transitions. [2019-12-18 12:25:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:25:33,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:33,888 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-18 12:25:33,888 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:33,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 3 times [2019-12-18 12:25:33,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:33,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473242565] [2019-12-18 12:25:33,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:34,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473242565] [2019-12-18 12:25:34,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:34,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:34,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024647689] [2019-12-18 12:25:34,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:25:34,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:34,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:25:34,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:34,014 INFO L87 Difference]: Start difference. First operand 26032 states and 80627 transitions. Second operand 10 states. [2019-12-18 12:25:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:34,834 INFO L93 Difference]: Finished difference Result 43340 states and 133082 transitions. [2019-12-18 12:25:34,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:25:34,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:25:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:34,885 INFO L225 Difference]: With dead ends: 43340 [2019-12-18 12:25:34,886 INFO L226 Difference]: Without dead ends: 36825 [2019-12-18 12:25:34,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:25:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36825 states. [2019-12-18 12:25:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36825 to 22389. [2019-12-18 12:25:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22389 states. [2019-12-18 12:25:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22389 states to 22389 states and 69376 transitions. [2019-12-18 12:25:35,341 INFO L78 Accepts]: Start accepts. Automaton has 22389 states and 69376 transitions. Word has length 67 [2019-12-18 12:25:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:35,342 INFO L462 AbstractCegarLoop]: Abstraction has 22389 states and 69376 transitions. [2019-12-18 12:25:35,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:25:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 22389 states and 69376 transitions. [2019-12-18 12:25:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:25:35,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:35,367 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-18 12:25:35,367 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 4 times [2019-12-18 12:25:35,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:35,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644416869] [2019-12-18 12:25:35,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:35,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644416869] [2019-12-18 12:25:35,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:35,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:35,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083410447] [2019-12-18 12:25:35,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:25:35,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:35,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:25:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:25:35,527 INFO L87 Difference]: Start difference. First operand 22389 states and 69376 transitions. Second operand 11 states. [2019-12-18 12:25:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:36,600 INFO L93 Difference]: Finished difference Result 39336 states and 121084 transitions. [2019-12-18 12:25:36,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:25:36,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:25:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:36,657 INFO L225 Difference]: With dead ends: 39336 [2019-12-18 12:25:36,657 INFO L226 Difference]: Without dead ends: 38317 [2019-12-18 12:25:36,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:25:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38317 states. [2019-12-18 12:25:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38317 to 24692. [2019-12-18 12:25:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24692 states. [2019-12-18 12:25:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24692 states to 24692 states and 76375 transitions. [2019-12-18 12:25:37,160 INFO L78 Accepts]: Start accepts. Automaton has 24692 states and 76375 transitions. Word has length 67 [2019-12-18 12:25:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:37,161 INFO L462 AbstractCegarLoop]: Abstraction has 24692 states and 76375 transitions. [2019-12-18 12:25:37,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:25:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 24692 states and 76375 transitions. [2019-12-18 12:25:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:25:37,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:37,189 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-18 12:25:37,190 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2136160587, now seen corresponding path program 5 times [2019-12-18 12:25:37,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:37,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713531262] [2019-12-18 12:25:37,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:37,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713531262] [2019-12-18 12:25:37,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:37,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:37,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584714231] [2019-12-18 12:25:37,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:25:37,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:37,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:25:37,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:25:37,340 INFO L87 Difference]: Start difference. First operand 24692 states and 76375 transitions. Second operand 11 states. [2019-12-18 12:25:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:38,228 INFO L93 Difference]: Finished difference Result 38879 states and 119266 transitions. [2019-12-18 12:25:38,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:25:38,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:25:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:38,278 INFO L225 Difference]: With dead ends: 38879 [2019-12-18 12:25:38,278 INFO L226 Difference]: Without dead ends: 35558 [2019-12-18 12:25:38,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:25:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35558 states. [2019-12-18 12:25:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35558 to 21700. [2019-12-18 12:25:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21700 states. [2019-12-18 12:25:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21700 states to 21700 states and 67268 transitions. [2019-12-18 12:25:38,738 INFO L78 Accepts]: Start accepts. Automaton has 21700 states and 67268 transitions. Word has length 67 [2019-12-18 12:25:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:38,739 INFO L462 AbstractCegarLoop]: Abstraction has 21700 states and 67268 transitions. [2019-12-18 12:25:38,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:25:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 21700 states and 67268 transitions. [2019-12-18 12:25:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:25:38,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:38,767 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-18 12:25:38,767 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 6 times [2019-12-18 12:25:38,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:38,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029341078] [2019-12-18 12:25:38,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:38,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029341078] [2019-12-18 12:25:38,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:38,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:25:38,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108644099] [2019-12-18 12:25:38,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:25:38,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:38,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:25:38,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:25:38,950 INFO L87 Difference]: Start difference. First operand 21700 states and 67268 transitions. Second operand 12 states. [2019-12-18 12:25:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:39,864 INFO L93 Difference]: Finished difference Result 35737 states and 109819 transitions. [2019-12-18 12:25:39,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:25:39,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:25:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:39,914 INFO L225 Difference]: With dead ends: 35737 [2019-12-18 12:25:39,914 INFO L226 Difference]: Without dead ends: 35526 [2019-12-18 12:25:39,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:25:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35526 states. [2019-12-18 12:25:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35526 to 21524. [2019-12-18 12:25:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21524 states. [2019-12-18 12:25:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21524 states to 21524 states and 66796 transitions. [2019-12-18 12:25:40,484 INFO L78 Accepts]: Start accepts. Automaton has 21524 states and 66796 transitions. Word has length 67 [2019-12-18 12:25:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:40,484 INFO L462 AbstractCegarLoop]: Abstraction has 21524 states and 66796 transitions. [2019-12-18 12:25:40,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:25:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21524 states and 66796 transitions. [2019-12-18 12:25:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:25:40,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:40,509 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-18 12:25:40,509 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 7 times [2019-12-18 12:25:40,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:40,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469929426] [2019-12-18 12:25:40,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:25:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:25:40,632 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:25:40,632 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:25:40,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (= 0 v_~__unbuffered_p2_EAX~0_31) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t263~0.base_33| 4)) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= 0 |v_ULTIMATE.start_main_~#t263~0.offset_23|) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t263~0.base_33|) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t263~0.base_33| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t263~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t263~0.base_33|) |v_ULTIMATE.start_main_~#t263~0.offset_23| 0)) |v_#memory_int_19|) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t263~0.base_33|) 0) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t263~0.offset=|v_ULTIMATE.start_main_~#t263~0.offset_23|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t265~0.offset=|v_ULTIMATE.start_main_~#t265~0.offset_19|, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ~a$read_delayed~0=v_~a$read_delayed~0_8, ULTIMATE.start_main_~#t264~0.offset=|v_ULTIMATE.start_main_~#t264~0.offset_19|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ULTIMATE.start_main_~#t265~0.base=|v_ULTIMATE.start_main_~#t265~0.base_25|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t263~0.base=|v_ULTIMATE.start_main_~#t263~0.base_33|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t264~0.base=|v_ULTIMATE.start_main_~#t264~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t263~0.offset, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t265~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t264~0.offset, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t265~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t263~0.base, #NULL.base, ULTIMATE.start_main_~#t264~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:25:40,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:25:40,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t264~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t264~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t264~0.base_12|) |v_ULTIMATE.start_main_~#t264~0.offset_10| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t264~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t264~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t264~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t264~0.base_12| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t264~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t264~0.base=|v_ULTIMATE.start_main_~#t264~0.base_12|, ULTIMATE.start_main_~#t264~0.offset=|v_ULTIMATE.start_main_~#t264~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t264~0.base, ULTIMATE.start_main_~#t264~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:25:40,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t265~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t265~0.base_12|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t265~0.base_12| 1) |v_#valid_32|) (not (= |v_ULTIMATE.start_main_~#t265~0.base_12| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t265~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t265~0.base_12|) |v_ULTIMATE.start_main_~#t265~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t265~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t265~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t265~0.offset=|v_ULTIMATE.start_main_~#t265~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t265~0.base=|v_ULTIMATE.start_main_~#t265~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t265~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t265~0.base] because there is no mapped edge [2019-12-18 12:25:40,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1539488562 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1539488562 256)))) (or (and (= ~a~0_In-1539488562 |P1Thread1of1ForFork2_#t~ite9_Out-1539488562|) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In-1539488562 |P1Thread1of1ForFork2_#t~ite9_Out-1539488562|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-1539488562, ~a$w_buff1~0=~a$w_buff1~0_In-1539488562, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1539488562, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1539488562} OutVars{~a~0=~a~0_In-1539488562, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1539488562|, ~a$w_buff1~0=~a$w_buff1~0_In-1539488562, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1539488562, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1539488562} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:25:40,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:25:40,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In726300165 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In726300165 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out726300165| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out726300165| ~a$w_buff0_used~0_In726300165)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In726300165, ~a$w_buff0_used~0=~a$w_buff0_used~0_In726300165} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In726300165, ~a$w_buff0_used~0=~a$w_buff0_used~0_In726300165, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out726300165|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:25:40,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-979732661 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-979732661 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-979732661 |P0Thread1of1ForFork1_#t~ite5_Out-979732661|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-979732661|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-979732661, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-979732661} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-979732661|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-979732661, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-979732661} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:25:40,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1225685227 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1225685227 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1225685227 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In1225685227 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out1225685227| ~a$w_buff1_used~0_In1225685227) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out1225685227| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1225685227, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1225685227, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1225685227, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1225685227} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1225685227|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1225685227, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1225685227, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1225685227, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1225685227} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:25:40,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-935002756 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-935002756 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out-935002756 ~a$r_buff0_thd1~0_In-935002756)) (and (= ~a$r_buff0_thd1~0_Out-935002756 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-935002756, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-935002756} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-935002756|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-935002756, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-935002756} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:25:40,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In2144010488 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In2144010488 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In2144010488 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In2144010488 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out2144010488|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$r_buff1_thd1~0_In2144010488 |P0Thread1of1ForFork1_#t~ite8_Out2144010488|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2144010488, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2144010488, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2144010488, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2144010488} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2144010488|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2144010488, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2144010488, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2144010488, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2144010488} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:25:40,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:25:40,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1125277350 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In-1125277350| |P2Thread1of1ForFork0_#t~ite20_Out-1125277350|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-1125277350| ~a$w_buff0~0_In-1125277350)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1125277350| |P2Thread1of1ForFork0_#t~ite20_Out-1125277350|) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-1125277350| ~a$w_buff0~0_In-1125277350) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1125277350 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1125277350 256) 0)) (and (= 0 (mod ~a$w_buff1_used~0_In-1125277350 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1125277350 256))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1125277350, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1125277350, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1125277350, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1125277350, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1125277350, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1125277350|, ~weak$$choice2~0=~weak$$choice2~0_In-1125277350} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1125277350|, ~a$w_buff0~0=~a$w_buff0~0_In-1125277350, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1125277350, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1125277350, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1125277350, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1125277350|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1125277350, ~weak$$choice2~0=~weak$$choice2~0_In-1125277350} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:25:40,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-264951267 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-264951267| ~a$w_buff0_used~0_In-264951267) (= |P2Thread1of1ForFork0_#t~ite26_In-264951267| |P2Thread1of1ForFork0_#t~ite26_Out-264951267|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-264951267 256)))) (or (and (= (mod ~a$w_buff1_used~0_In-264951267 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-264951267 256)) (and (= (mod ~a$r_buff1_thd3~0_In-264951267 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out-264951267| |P2Thread1of1ForFork0_#t~ite26_Out-264951267|) (= ~a$w_buff0_used~0_In-264951267 |P2Thread1of1ForFork0_#t~ite26_Out-264951267|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-264951267|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-264951267, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-264951267, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-264951267, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-264951267, ~weak$$choice2~0=~weak$$choice2~0_In-264951267} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-264951267|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-264951267|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-264951267, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-264951267, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-264951267, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-264951267, ~weak$$choice2~0=~weak$$choice2~0_In-264951267} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:25:40,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:25:40,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:25:40,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-324154035 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-324154035 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-324154035| |P2Thread1of1ForFork0_#t~ite39_Out-324154035|))) (or (and (not .cse0) (= ~a$w_buff1~0_In-324154035 |P2Thread1of1ForFork0_#t~ite38_Out-324154035|) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-324154035| ~a~0_In-324154035) (or .cse0 .cse1) .cse2))) InVars {~a~0=~a~0_In-324154035, ~a$w_buff1~0=~a$w_buff1~0_In-324154035, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-324154035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-324154035} OutVars{~a~0=~a~0_In-324154035, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-324154035|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-324154035|, ~a$w_buff1~0=~a$w_buff1~0_In-324154035, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-324154035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-324154035} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:25:40,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In572672811 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In572672811 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out572672811| ~a$w_buff0_used~0_In572672811)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out572672811| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In572672811, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In572672811} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out572672811|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In572672811, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In572672811} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:25:40,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-196962025 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-196962025 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-196962025 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-196962025 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-196962025| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-196962025| ~a$w_buff1_used~0_In-196962025) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-196962025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-196962025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-196962025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-196962025} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-196962025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-196962025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-196962025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-196962025, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-196962025|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:25:40,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-808028351 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-808028351 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-808028351 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-808028351 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-808028351 |P1Thread1of1ForFork2_#t~ite12_Out-808028351|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-808028351| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-808028351, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-808028351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-808028351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-808028351} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-808028351, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-808028351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-808028351, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-808028351|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-808028351} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:25:40,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1161123068 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1161123068 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1161123068|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In1161123068 |P1Thread1of1ForFork2_#t~ite13_Out1161123068|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1161123068, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1161123068} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1161123068, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1161123068, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1161123068|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:25:40,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1809025617 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1809025617 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1809025617 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1809025617 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out1809025617| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1809025617| ~a$r_buff1_thd2~0_In1809025617) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1809025617, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1809025617, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1809025617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1809025617} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1809025617, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1809025617, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1809025617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1809025617, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1809025617|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:25:40,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:25:40,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1600471081 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1600471081 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1600471081| ~a$r_buff0_thd3~0_In1600471081)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1600471081| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1600471081, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1600471081} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1600471081, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1600471081, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1600471081|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:25:40,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1122537396 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1122537396 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-1122537396 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1122537396 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-1122537396 |P2Thread1of1ForFork0_#t~ite43_Out-1122537396|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1122537396|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1122537396, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122537396, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1122537396, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1122537396} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1122537396|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1122537396, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122537396, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1122537396, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1122537396} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:25:40,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:25:40,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:25:40,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1396805293 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1396805293 256) 0))) (or (and (= ~a$w_buff1~0_In1396805293 |ULTIMATE.start_main_#t~ite47_Out1396805293|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1396805293| ~a~0_In1396805293)))) InVars {~a~0=~a~0_In1396805293, ~a$w_buff1~0=~a$w_buff1~0_In1396805293, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1396805293, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1396805293} OutVars{~a~0=~a~0_In1396805293, ~a$w_buff1~0=~a$w_buff1~0_In1396805293, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1396805293|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1396805293, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1396805293} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:25:40,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:25:40,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-2072827565 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-2072827565 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2072827565 |ULTIMATE.start_main_#t~ite49_Out-2072827565|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-2072827565|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2072827565, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2072827565} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2072827565, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2072827565|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2072827565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:25:40,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1518428044 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1518428044 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1518428044 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1518428044 256) 0))) (or (and (= ~a$w_buff1_used~0_In1518428044 |ULTIMATE.start_main_#t~ite50_Out1518428044|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1518428044|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1518428044, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1518428044, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1518428044, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1518428044} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1518428044|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1518428044, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1518428044, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1518428044, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1518428044} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:25:40,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In280608620 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In280608620 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out280608620| ~a$r_buff0_thd0~0_In280608620) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out280608620| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In280608620, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In280608620} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out280608620|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In280608620, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In280608620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:25:40,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-226982763 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-226982763 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-226982763 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-226982763 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-226982763| ~a$r_buff1_thd0~0_In-226982763)) (and (= |ULTIMATE.start_main_#t~ite52_Out-226982763| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-226982763, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-226982763, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-226982763, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-226982763} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-226982763|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-226982763, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-226982763, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-226982763, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-226982763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:25:40,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:25:40,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:25:40 BasicIcfg [2019-12-18 12:25:40,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:25:40,757 INFO L168 Benchmark]: Toolchain (without parser) took 142120.82 ms. Allocated memory was 145.2 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 911.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:25:40,758 INFO L168 Benchmark]: CDTParser took 1.29 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:25:40,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.20 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 156.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:25:40,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:25:40,759 INFO L168 Benchmark]: Boogie Preprocessor took 61.64 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:25:40,759 INFO L168 Benchmark]: RCFGBuilder took 788.82 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.1 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:25:40,760 INFO L168 Benchmark]: TraceAbstraction took 140434.40 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 851.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:25:40,761 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.20 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 156.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.64 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 788.82 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.1 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 140434.40 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 851.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t263, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t264, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t265, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$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, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.1s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 48.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11022 SDtfs, 16877 SDslu, 41029 SDs, 0 SdLazy, 20006 SolverSat, 829 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 98 SyntacticMatches, 26 SemanticMatches, 502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred 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: 59.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 780296 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1975 NumberOfCodeBlocks, 1975 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1871 ConstructedInterpolants, 0 QuantifiedInterpolants, 423339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...