/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/mix015_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:33:29,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:33:29,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:33:29,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:33:29,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:33:29,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:33:29,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:33:29,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:33:29,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:33:29,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:33:29,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:33:29,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:33:29,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:33:29,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:33:29,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:33:29,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:33:29,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:33:29,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:33:29,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:33:29,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:33:29,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:33:29,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:33:29,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:33:29,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:33:29,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:33:29,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:33:29,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:33:29,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:33:29,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:33:29,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:33:29,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:33:29,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:33:29,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:33:29,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:33:29,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:33:29,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:33:29,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:33:29,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:33:29,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:33:29,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:33:29,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:33:29,375 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:33:29,389 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:33:29,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:33:29,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:33:29,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:33:29,391 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:33:29,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:33:29,391 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:33:29,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:33:29,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:33:29,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:33:29,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:33:29,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:33:29,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:33:29,393 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:33:29,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:33:29,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:33:29,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:33:29,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:33:29,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:33:29,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:33:29,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:33:29,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:33:29,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:33:29,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:33:29,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:33:29,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:33:29,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:33:29,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:33:29,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:33:29,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:33:29,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:33:29,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:33:29,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:33:29,722 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:33:29,723 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:33:29,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i [2019-12-18 12:33:29,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2d044db/cbd92562acd147b3b1aab6bd5c19328c/FLAG6e17a7354 [2019-12-18 12:33:30,374 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:33:30,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i [2019-12-18 12:33:30,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2d044db/cbd92562acd147b3b1aab6bd5c19328c/FLAG6e17a7354 [2019-12-18 12:33:30,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2d044db/cbd92562acd147b3b1aab6bd5c19328c [2019-12-18 12:33:30,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:33:30,630 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:33:30,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:33:30,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:33:30,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:33:30,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:33:30" (1/1) ... [2019-12-18 12:33:30,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b9f3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:30, skipping insertion in model container [2019-12-18 12:33:30,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:33:30" (1/1) ... [2019-12-18 12:33:30,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:33:30,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:33:31,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:33:31,216 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:33:31,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:33:31,383 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:33:31,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31 WrapperNode [2019-12-18 12:33:31,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:33:31,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:33:31,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:33:31,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:33:31,395 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:33:31" (1/1) ... [2019-12-18 12:33:31,416 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:33:31" (1/1) ... [2019-12-18 12:33:31,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:33:31,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:33:31,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:33:31,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:33:31,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (1/1) ... [2019-12-18 12:33:31,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (1/1) ... [2019-12-18 12:33:31,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (1/1) ... [2019-12-18 12:33:31,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (1/1) ... [2019-12-18 12:33:31,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (1/1) ... [2019-12-18 12:33:31,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (1/1) ... [2019-12-18 12:33:31,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (1/1) ... [2019-12-18 12:33:31,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:33:31,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:33:31,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:33:31,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:33:31,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:33:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:33:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:33:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:33:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:33:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:33:31,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:33:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:33:31,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:33:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:33:31,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:33:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:33:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:33:31,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:33:31,584 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:33:32,422 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:33:32,422 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:33:32,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:33:32 BoogieIcfgContainer [2019-12-18 12:33:32,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:33:32,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:33:32,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:33:32,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:33:32,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:33:30" (1/3) ... [2019-12-18 12:33:32,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38438307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:33:32, skipping insertion in model container [2019-12-18 12:33:32,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:31" (2/3) ... [2019-12-18 12:33:32,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38438307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:33:32, skipping insertion in model container [2019-12-18 12:33:32,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:33:32" (3/3) ... [2019-12-18 12:33:32,433 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_tso.oepc.i [2019-12-18 12:33:32,444 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:33:32,444 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:33:32,452 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:33:32,453 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:33:32,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,494 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,505 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,505 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,514 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,514 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,563 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,573 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:32,597 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:33:32,618 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:33:32,618 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:33:32,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:33:32,618 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:33:32,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:33:32,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:33:32,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:33:32,619 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:33:32,636 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 12:33:32,639 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:33:32,729 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:33:32,730 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:33:32,753 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 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:33:32,782 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:33:32,828 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:33:32,829 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:33:32,837 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 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:33:32,859 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:33:32,861 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:33:37,602 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-18 12:33:38,329 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:33:38,484 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:33:38,652 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-18 12:33:38,652 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 12:33:38,656 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-18 12:33:58,513 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-18 12:33:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-18 12:33:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:33:58,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:58,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:33:58,522 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:33:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-18 12:33:58,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:58,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422538685] [2019-12-18 12:33:58,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:58,735 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:33:58,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422538685] [2019-12-18 12:33:58,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:58,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:33:58,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666734435] [2019-12-18 12:33:58,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:58,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:58,772 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-18 12:34:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:02,280 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-18 12:34:02,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:02,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:34:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:03,020 INFO L225 Difference]: With dead ends: 116858 [2019-12-18 12:34:03,020 INFO L226 Difference]: Without dead ends: 110138 [2019-12-18 12:34:03,022 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:34:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-18 12:34:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-18 12:34:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-18 12:34:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-18 12:34:11,833 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-18 12:34:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:11,833 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-18 12:34:11,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-18 12:34:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:34:11,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:11,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:11,837 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:34:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-18 12:34:11,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:11,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276570487] [2019-12-18 12:34:11,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:11,986 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:34:11,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276570487] [2019-12-18 12:34:11,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:11,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:11,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71923926] [2019-12-18 12:34:11,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:11,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:11,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:11,990 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-18 12:34:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:17,129 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-18 12:34:17,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:17,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:34:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:17,651 INFO L225 Difference]: With dead ends: 170904 [2019-12-18 12:34:17,651 INFO L226 Difference]: Without dead ends: 170855 [2019-12-18 12:34:17,652 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:34:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-18 12:34:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-18 12:34:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-18 12:34:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-18 12:34:31,607 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-18 12:34:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:31,607 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-18 12:34:31,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-18 12:34:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:34:31,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:31,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:31,615 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:34:31,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:31,615 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-18 12:34:31,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:31,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283317676] [2019-12-18 12:34:31,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:31,689 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:34:31,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283317676] [2019-12-18 12:34:31,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:31,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:31,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469675690] [2019-12-18 12:34:31,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:31,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:31,691 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-18 12:34:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:31,825 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-18 12:34:31,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:31,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:34:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:31,938 INFO L225 Difference]: With dead ends: 33673 [2019-12-18 12:34:31,939 INFO L226 Difference]: Without dead ends: 33673 [2019-12-18 12:34:31,939 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:34:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-18 12:34:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-18 12:34:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-18 12:34:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-18 12:34:37,518 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-18 12:34:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:37,519 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-18 12:34:37,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-18 12:34:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:34:37,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:37,522 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:34:37,522 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:34:37,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:37,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-18 12:34:37,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:37,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859402324] [2019-12-18 12:34:37,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:37,627 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:34:37,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859402324] [2019-12-18 12:34:37,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:37,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:37,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727614309] [2019-12-18 12:34:37,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:37,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:37,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:37,633 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-18 12:34:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:37,978 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-18 12:34:37,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:37,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:34:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:38,056 INFO L225 Difference]: With dead ends: 42056 [2019-12-18 12:34:38,056 INFO L226 Difference]: Without dead ends: 42056 [2019-12-18 12:34:38,057 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:34:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-18 12:34:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-18 12:34:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-18 12:34:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-18 12:34:38,817 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-18 12:34:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:38,818 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-18 12:34:38,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-18 12:34:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:34:38,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:38,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:38,827 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:34:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-18 12:34:38,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:38,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844768805] [2019-12-18 12:34:38,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:38,905 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:34:38,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844768805] [2019-12-18 12:34:38,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:38,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:38,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075033154] [2019-12-18 12:34:38,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:38,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:38,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:38,908 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-18 12:34:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:39,936 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-18 12:34:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:39,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:34:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:40,004 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 12:34:40,004 INFO L226 Difference]: Without dead ends: 48530 [2019-12-18 12:34:40,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-18 12:34:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-18 12:34:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-18 12:34:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-18 12:34:40,716 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-18 12:34:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:40,716 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-18 12:34:40,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:34:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-18 12:34:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:34:40,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:40,728 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:34:40,728 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:34:40,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-18 12:34:40,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:40,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959197002] [2019-12-18 12:34:40,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:40,802 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:34:40,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959197002] [2019-12-18 12:34:40,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:40,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:40,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978395304] [2019-12-18 12:34:40,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:40,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:40,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:40,805 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-18 12:34:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:40,887 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-18 12:34:40,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:34:40,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:34:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:40,915 INFO L225 Difference]: With dead ends: 14576 [2019-12-18 12:34:40,915 INFO L226 Difference]: Without dead ends: 14576 [2019-12-18 12:34:40,916 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:34:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-18 12:34:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-18 12:34:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-18 12:34:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-18 12:34:41,151 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-18 12:34:41,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:41,152 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-18 12:34:41,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-18 12:34:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:41,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:41,162 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:34:41,163 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:34:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-18 12:34:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:41,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956240543] [2019-12-18 12:34:41,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:41,205 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:34:41,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956240543] [2019-12-18 12:34:41,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:41,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:41,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935706001] [2019-12-18 12:34:41,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:41,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:41,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:41,207 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-18 12:34:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:41,314 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-18 12:34:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:41,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:34:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:41,347 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 12:34:41,347 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 12:34:41,348 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:34:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 12:34:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 12:34:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 12:34:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-18 12:34:41,644 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-18 12:34:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:41,645 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-18 12:34:41,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-18 12:34:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:41,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:41,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:41,657 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:34:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-18 12:34:41,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:41,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201196201] [2019-12-18 12:34:41,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:41,694 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:34:41,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201196201] [2019-12-18 12:34:41,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:41,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:41,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455865415] [2019-12-18 12:34:41,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:41,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:41,696 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-18 12:34:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:42,017 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-18 12:34:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:42,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:34:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:42,059 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 12:34:42,059 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 12:34:42,060 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:34:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 12:34:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 12:34:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 12:34:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-18 12:34:42,364 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-18 12:34:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:42,365 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-18 12:34:42,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-18 12:34:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:42,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:42,378 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:34:42,378 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:34:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-18 12:34:42,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:42,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796282922] [2019-12-18 12:34:42,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:42,474 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:34:42,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796282922] [2019-12-18 12:34:42,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:42,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:34:42,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024362968] [2019-12-18 12:34:42,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:34:42,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:34:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:34:42,477 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-18 12:34:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:43,105 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-18 12:34:43,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:43,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:34:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:43,150 INFO L225 Difference]: With dead ends: 31275 [2019-12-18 12:34:43,150 INFO L226 Difference]: Without dead ends: 31275 [2019-12-18 12:34:43,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-18 12:34:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-18 12:34:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-18 12:34:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-18 12:34:43,535 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-18 12:34:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:43,535 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-18 12:34:43,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:34:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-18 12:34:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:34:43,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:43,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:43,551 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:34:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-18 12:34:43,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:43,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149461405] [2019-12-18 12:34:43,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:43,629 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:34:43,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149461405] [2019-12-18 12:34:43,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:43,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:34:43,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785076919] [2019-12-18 12:34:43,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:34:43,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:43,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:34:43,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:34:43,632 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-18 12:34:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:44,319 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-18 12:34:44,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:44,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:34:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:44,362 INFO L225 Difference]: With dead ends: 30618 [2019-12-18 12:34:44,363 INFO L226 Difference]: Without dead ends: 30618 [2019-12-18 12:34:44,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-18 12:34:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-18 12:34:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-18 12:34:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-18 12:34:44,747 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-18 12:34:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:44,747 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-18 12:34:44,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:34:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-18 12:34:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:34:44,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:44,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:44,768 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:34:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:44,768 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-18 12:34:44,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:44,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535876163] [2019-12-18 12:34:44,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:44,830 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:34:44,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535876163] [2019-12-18 12:34:44,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:44,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:44,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465857954] [2019-12-18 12:34:44,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:44,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:44,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:44,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:44,833 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-18 12:34:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:45,484 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-18 12:34:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:34:45,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 12:34:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:45,535 INFO L225 Difference]: With dead ends: 23829 [2019-12-18 12:34:45,535 INFO L226 Difference]: Without dead ends: 23829 [2019-12-18 12:34:45,535 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:34:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-18 12:34:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-18 12:34:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-18 12:34:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-18 12:34:45,901 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-18 12:34:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:45,902 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-18 12:34:45,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:34:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-18 12:34:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:34:45,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:45,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:45,924 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:34:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-18 12:34:45,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:45,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846559132] [2019-12-18 12:34:45,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:46,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:34:46,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846559132] [2019-12-18 12:34:46,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:46,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:34:46,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565965597] [2019-12-18 12:34:46,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:34:46,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:34:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:46,012 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-18 12:34:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:47,373 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-18 12:34:47,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:34:47,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:34:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:47,430 INFO L225 Difference]: With dead ends: 39715 [2019-12-18 12:34:47,430 INFO L226 Difference]: Without dead ends: 39715 [2019-12-18 12:34:47,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:34:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-18 12:34:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-18 12:34:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-18 12:34:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-18 12:34:47,887 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-18 12:34:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:47,887 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-18 12:34:47,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:34:47,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-18 12:34:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:34:47,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:47,904 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:34:47,905 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:34:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-18 12:34:47,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:47,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676945889] [2019-12-18 12:34:47,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:48,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:34:48,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676945889] [2019-12-18 12:34:48,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:48,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:34:48,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701737635] [2019-12-18 12:34:48,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:34:48,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:34:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:34:48,011 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 8 states. [2019-12-18 12:34:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:49,694 INFO L93 Difference]: Finished difference Result 46968 states and 136953 transitions. [2019-12-18 12:34:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:34:49,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:34:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:50,043 INFO L225 Difference]: With dead ends: 46968 [2019-12-18 12:34:50,043 INFO L226 Difference]: Without dead ends: 46968 [2019-12-18 12:34:50,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:34:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46968 states. [2019-12-18 12:34:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46968 to 20735. [2019-12-18 12:34:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-18 12:34:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 61975 transitions. [2019-12-18 12:34:50,526 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 61975 transitions. Word has length 33 [2019-12-18 12:34:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:50,526 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 61975 transitions. [2019-12-18 12:34:50,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:34:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 61975 transitions. [2019-12-18 12:34:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:34:50,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:50,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:50,543 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:34:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-18 12:34:50,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:50,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092626945] [2019-12-18 12:34:50,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:50,653 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:34:50,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092626945] [2019-12-18 12:34:50,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:50,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:34:50,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636032652] [2019-12-18 12:34:50,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:34:50,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:50,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:34:50,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:50,656 INFO L87 Difference]: Start difference. First operand 20735 states and 61975 transitions. Second operand 7 states. [2019-12-18 12:34:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:51,972 INFO L93 Difference]: Finished difference Result 36504 states and 106979 transitions. [2019-12-18 12:34:51,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:34:51,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:34:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:52,025 INFO L225 Difference]: With dead ends: 36504 [2019-12-18 12:34:52,025 INFO L226 Difference]: Without dead ends: 36504 [2019-12-18 12:34:52,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:34:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36504 states. [2019-12-18 12:34:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36504 to 19450. [2019-12-18 12:34:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19450 states. [2019-12-18 12:34:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19450 states to 19450 states and 58223 transitions. [2019-12-18 12:34:52,455 INFO L78 Accepts]: Start accepts. Automaton has 19450 states and 58223 transitions. Word has length 34 [2019-12-18 12:34:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:52,456 INFO L462 AbstractCegarLoop]: Abstraction has 19450 states and 58223 transitions. [2019-12-18 12:34:52,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:34:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 19450 states and 58223 transitions. [2019-12-18 12:34:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:34:52,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:52,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:52,475 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:34:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:52,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-18 12:34:52,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:52,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919844521] [2019-12-18 12:34:52,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:52,594 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:34:52,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919844521] [2019-12-18 12:34:52,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:52,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:34:52,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061387638] [2019-12-18 12:34:52,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:34:52,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:52,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:34:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:34:52,596 INFO L87 Difference]: Start difference. First operand 19450 states and 58223 transitions. Second operand 8 states. [2019-12-18 12:34:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:54,326 INFO L93 Difference]: Finished difference Result 41529 states and 120361 transitions. [2019-12-18 12:34:54,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:34:54,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 12:34:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:54,404 INFO L225 Difference]: With dead ends: 41529 [2019-12-18 12:34:54,404 INFO L226 Difference]: Without dead ends: 41529 [2019-12-18 12:34:54,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:34:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41529 states. [2019-12-18 12:34:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41529 to 17750. [2019-12-18 12:34:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17750 states. [2019-12-18 12:34:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17750 states to 17750 states and 53183 transitions. [2019-12-18 12:34:55,152 INFO L78 Accepts]: Start accepts. Automaton has 17750 states and 53183 transitions. Word has length 34 [2019-12-18 12:34:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:55,152 INFO L462 AbstractCegarLoop]: Abstraction has 17750 states and 53183 transitions. [2019-12-18 12:34:55,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:34:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 17750 states and 53183 transitions. [2019-12-18 12:34:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:34:55,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:55,175 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:34:55,175 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:34:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-18 12:34:55,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:55,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14737653] [2019-12-18 12:34:55,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:55,224 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:34:55,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14737653] [2019-12-18 12:34:55,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:55,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:55,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646755812] [2019-12-18 12:34:55,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:55,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:55,226 INFO L87 Difference]: Start difference. First operand 17750 states and 53183 transitions. Second operand 4 states. [2019-12-18 12:34:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:55,339 INFO L93 Difference]: Finished difference Result 30219 states and 90879 transitions. [2019-12-18 12:34:55,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:34:55,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 12:34:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:55,361 INFO L225 Difference]: With dead ends: 30219 [2019-12-18 12:34:55,361 INFO L226 Difference]: Without dead ends: 15274 [2019-12-18 12:34:55,361 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:34:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-12-18 12:34:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 15208. [2019-12-18 12:34:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-18 12:34:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44774 transitions. [2019-12-18 12:34:55,599 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44774 transitions. Word has length 39 [2019-12-18 12:34:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:55,599 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44774 transitions. [2019-12-18 12:34:55,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44774 transitions. [2019-12-18 12:34:55,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:34:55,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:55,616 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:34:55,616 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:34:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-18 12:34:55,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:55,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379896532] [2019-12-18 12:34:55,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:55,670 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:34:55,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379896532] [2019-12-18 12:34:55,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:55,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:34:55,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724543716] [2019-12-18 12:34:55,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:55,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:55,672 INFO L87 Difference]: Start difference. First operand 15208 states and 44774 transitions. Second operand 3 states. [2019-12-18 12:34:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:55,736 INFO L93 Difference]: Finished difference Result 15207 states and 44772 transitions. [2019-12-18 12:34:55,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:55,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:34:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:55,762 INFO L225 Difference]: With dead ends: 15207 [2019-12-18 12:34:55,763 INFO L226 Difference]: Without dead ends: 15207 [2019-12-18 12:34:55,763 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:34:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2019-12-18 12:34:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 15207. [2019-12-18 12:34:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15207 states. [2019-12-18 12:34:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15207 states to 15207 states and 44772 transitions. [2019-12-18 12:34:56,044 INFO L78 Accepts]: Start accepts. Automaton has 15207 states and 44772 transitions. Word has length 39 [2019-12-18 12:34:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:56,045 INFO L462 AbstractCegarLoop]: Abstraction has 15207 states and 44772 transitions. [2019-12-18 12:34:56,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15207 states and 44772 transitions. [2019-12-18 12:34:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:34:56,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:56,059 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:34:56,059 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:34:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-18 12:34:56,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:56,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215511796] [2019-12-18 12:34:56,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:56,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:34:56,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215511796] [2019-12-18 12:34:56,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:56,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:56,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482081265] [2019-12-18 12:34:56,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:56,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:56,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:56,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:56,116 INFO L87 Difference]: Start difference. First operand 15207 states and 44772 transitions. Second operand 4 states. [2019-12-18 12:34:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:56,234 INFO L93 Difference]: Finished difference Result 24324 states and 71986 transitions. [2019-12-18 12:34:56,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:34:56,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 12:34:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:56,258 INFO L225 Difference]: With dead ends: 24324 [2019-12-18 12:34:56,258 INFO L226 Difference]: Without dead ends: 11139 [2019-12-18 12:34:56,259 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:34:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11139 states. [2019-12-18 12:34:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11139 to 11082. [2019-12-18 12:34:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2019-12-18 12:34:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 31786 transitions. [2019-12-18 12:34:56,519 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 31786 transitions. Word has length 40 [2019-12-18 12:34:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:56,520 INFO L462 AbstractCegarLoop]: Abstraction has 11082 states and 31786 transitions. [2019-12-18 12:34:56,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 31786 transitions. [2019-12-18 12:34:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:34:56,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:56,533 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:34:56,534 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:34:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-18 12:34:56,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:56,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926080399] [2019-12-18 12:34:56,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:56,591 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:34:56,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926080399] [2019-12-18 12:34:56,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:56,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:34:56,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638756624] [2019-12-18 12:34:56,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:56,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:56,593 INFO L87 Difference]: Start difference. First operand 11082 states and 31786 transitions. Second operand 5 states. [2019-12-18 12:34:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:56,653 INFO L93 Difference]: Finished difference Result 10120 states and 29645 transitions. [2019-12-18 12:34:56,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:56,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:34:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:56,667 INFO L225 Difference]: With dead ends: 10120 [2019-12-18 12:34:56,668 INFO L226 Difference]: Without dead ends: 7230 [2019-12-18 12:34:56,668 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:34:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-18 12:34:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7230. [2019-12-18 12:34:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-12-18 12:34:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 23189 transitions. [2019-12-18 12:34:56,831 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 23189 transitions. Word has length 40 [2019-12-18 12:34:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:56,831 INFO L462 AbstractCegarLoop]: Abstraction has 7230 states and 23189 transitions. [2019-12-18 12:34:56,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:34:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 23189 transitions. [2019-12-18 12:34:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:34:56,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:56,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] [2019-12-18 12:34:56,840 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:34:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-18 12:34:56,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:56,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784140651] [2019-12-18 12:34:56,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:56,917 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:34:56,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784140651] [2019-12-18 12:34:56,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:56,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:34:56,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593398975] [2019-12-18 12:34:56,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:34:56,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:56,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:34:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:56,919 INFO L87 Difference]: Start difference. First operand 7230 states and 23189 transitions. Second operand 7 states. [2019-12-18 12:34:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:57,179 INFO L93 Difference]: Finished difference Result 14425 states and 45327 transitions. [2019-12-18 12:34:57,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:34:57,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:34:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:57,196 INFO L225 Difference]: With dead ends: 14425 [2019-12-18 12:34:57,196 INFO L226 Difference]: Without dead ends: 10624 [2019-12-18 12:34:57,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:34:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2019-12-18 12:34:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 8673. [2019-12-18 12:34:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-18 12:34:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 27719 transitions. [2019-12-18 12:34:57,359 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 27719 transitions. Word has length 64 [2019-12-18 12:34:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:57,359 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 27719 transitions. [2019-12-18 12:34:57,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:34:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 27719 transitions. [2019-12-18 12:34:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:34:57,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:57,369 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:34:57,369 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:34:57,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-18 12:34:57,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:57,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901482547] [2019-12-18 12:34:57,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:57,454 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:34:57,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901482547] [2019-12-18 12:34:57,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:57,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:34:57,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700169753] [2019-12-18 12:34:57,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:34:57,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:57,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:34:57,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:57,456 INFO L87 Difference]: Start difference. First operand 8673 states and 27719 transitions. Second operand 7 states. [2019-12-18 12:34:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:57,928 INFO L93 Difference]: Finished difference Result 16977 states and 52978 transitions. [2019-12-18 12:34:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:34:57,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:34:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:57,952 INFO L225 Difference]: With dead ends: 16977 [2019-12-18 12:34:57,952 INFO L226 Difference]: Without dead ends: 12608 [2019-12-18 12:34:57,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:34:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2019-12-18 12:34:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10249. [2019-12-18 12:34:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2019-12-18 12:34:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 32525 transitions. [2019-12-18 12:34:58,145 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 32525 transitions. Word has length 64 [2019-12-18 12:34:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:58,145 INFO L462 AbstractCegarLoop]: Abstraction has 10249 states and 32525 transitions. [2019-12-18 12:34:58,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:34:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 32525 transitions. [2019-12-18 12:34:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:34:58,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:58,157 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:34:58,157 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:34:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-18 12:34:58,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:58,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135107184] [2019-12-18 12:34:58,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:58,275 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:34:58,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135107184] [2019-12-18 12:34:58,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:58,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:58,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738791394] [2019-12-18 12:34:58,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:34:58,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:58,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:34:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:58,278 INFO L87 Difference]: Start difference. First operand 10249 states and 32525 transitions. Second operand 9 states. [2019-12-18 12:34:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:59,511 INFO L93 Difference]: Finished difference Result 29742 states and 92736 transitions. [2019-12-18 12:34:59,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:34:59,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:34:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:59,582 INFO L225 Difference]: With dead ends: 29742 [2019-12-18 12:34:59,583 INFO L226 Difference]: Without dead ends: 27534 [2019-12-18 12:34:59,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:34:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-18 12:35:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 10384. [2019-12-18 12:35:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-12-18 12:35:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 33017 transitions. [2019-12-18 12:35:00,128 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 33017 transitions. Word has length 64 [2019-12-18 12:35:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:00,128 INFO L462 AbstractCegarLoop]: Abstraction has 10384 states and 33017 transitions. [2019-12-18 12:35:00,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 33017 transitions. [2019-12-18 12:35:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:35:00,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:00,144 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:35:00,144 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:35:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1263766943, now seen corresponding path program 4 times [2019-12-18 12:35:00,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:00,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060430054] [2019-12-18 12:35:00,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:00,259 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:35:00,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060430054] [2019-12-18 12:35:00,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:00,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:00,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235893777] [2019-12-18 12:35:00,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:00,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:00,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:00,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:00,265 INFO L87 Difference]: Start difference. First operand 10384 states and 33017 transitions. Second operand 9 states. [2019-12-18 12:35:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:01,244 INFO L93 Difference]: Finished difference Result 23762 states and 74154 transitions. [2019-12-18 12:35:01,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:35:01,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:35:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:01,275 INFO L225 Difference]: With dead ends: 23762 [2019-12-18 12:35:01,275 INFO L226 Difference]: Without dead ends: 22008 [2019-12-18 12:35:01,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:35:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2019-12-18 12:35:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 10264. [2019-12-18 12:35:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-18 12:35:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 32661 transitions. [2019-12-18 12:35:01,529 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 32661 transitions. Word has length 64 [2019-12-18 12:35:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:01,529 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 32661 transitions. [2019-12-18 12:35:01,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 32661 transitions. [2019-12-18 12:35:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:35:01,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:01,541 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:35:01,542 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:35:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 5 times [2019-12-18 12:35:01,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:01,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611746759] [2019-12-18 12:35:01,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:01,602 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:35:01,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611746759] [2019-12-18 12:35:01,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:01,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:01,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622772467] [2019-12-18 12:35:01,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:01,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:01,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:01,604 INFO L87 Difference]: Start difference. First operand 10264 states and 32661 transitions. Second operand 3 states. [2019-12-18 12:35:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:01,707 INFO L93 Difference]: Finished difference Result 11837 states and 37523 transitions. [2019-12-18 12:35:01,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:01,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:35:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:01,729 INFO L225 Difference]: With dead ends: 11837 [2019-12-18 12:35:01,729 INFO L226 Difference]: Without dead ends: 11837 [2019-12-18 12:35:01,730 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:35:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2019-12-18 12:35:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 10693. [2019-12-18 12:35:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10693 states. [2019-12-18 12:35:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 34091 transitions. [2019-12-18 12:35:01,937 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 34091 transitions. Word has length 64 [2019-12-18 12:35:01,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:01,937 INFO L462 AbstractCegarLoop]: Abstraction has 10693 states and 34091 transitions. [2019-12-18 12:35:01,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 34091 transitions. [2019-12-18 12:35:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:01,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:01,949 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:35:01,949 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:35:01,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:01,950 INFO L82 PathProgramCache]: Analyzing trace with hash -671653730, now seen corresponding path program 1 times [2019-12-18 12:35:01,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:01,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085617425] [2019-12-18 12:35:01,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:02,066 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:35:02,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085617425] [2019-12-18 12:35:02,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:02,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:02,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079426586] [2019-12-18 12:35:02,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:02,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:02,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:02,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:02,069 INFO L87 Difference]: Start difference. First operand 10693 states and 34091 transitions. Second operand 9 states. [2019-12-18 12:35:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:03,388 INFO L93 Difference]: Finished difference Result 25976 states and 80362 transitions. [2019-12-18 12:35:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:35:03,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:35:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:03,420 INFO L225 Difference]: With dead ends: 25976 [2019-12-18 12:35:03,420 INFO L226 Difference]: Without dead ends: 21905 [2019-12-18 12:35:03,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:35:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21905 states. [2019-12-18 12:35:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21905 to 10558. [2019-12-18 12:35:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10558 states. [2019-12-18 12:35:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 33265 transitions. [2019-12-18 12:35:03,662 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 33265 transitions. Word has length 65 [2019-12-18 12:35:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:03,662 INFO L462 AbstractCegarLoop]: Abstraction has 10558 states and 33265 transitions. [2019-12-18 12:35:03,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 33265 transitions. [2019-12-18 12:35:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:03,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:03,673 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:35:03,673 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:35:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1962638562, now seen corresponding path program 2 times [2019-12-18 12:35:03,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:03,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072466475] [2019-12-18 12:35:03,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:03,793 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:35:03,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072466475] [2019-12-18 12:35:03,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:03,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:03,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270214748] [2019-12-18 12:35:03,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:03,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:03,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:03,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:03,795 INFO L87 Difference]: Start difference. First operand 10558 states and 33265 transitions. Second operand 9 states. [2019-12-18 12:35:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:04,622 INFO L93 Difference]: Finished difference Result 21151 states and 64928 transitions. [2019-12-18 12:35:04,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:35:04,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:35:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:04,651 INFO L225 Difference]: With dead ends: 21151 [2019-12-18 12:35:04,651 INFO L226 Difference]: Without dead ends: 19285 [2019-12-18 12:35:04,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:35:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19285 states. [2019-12-18 12:35:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19285 to 10198. [2019-12-18 12:35:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10198 states. [2019-12-18 12:35:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 32203 transitions. [2019-12-18 12:35:04,879 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 32203 transitions. Word has length 65 [2019-12-18 12:35:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:04,879 INFO L462 AbstractCegarLoop]: Abstraction has 10198 states and 32203 transitions. [2019-12-18 12:35:04,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 32203 transitions. [2019-12-18 12:35:04,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:04,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:04,891 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:35:04,891 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:35:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:04,891 INFO L82 PathProgramCache]: Analyzing trace with hash -151344766, now seen corresponding path program 3 times [2019-12-18 12:35:04,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:04,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702968120] [2019-12-18 12:35:04,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:04,979 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:35:04,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702968120] [2019-12-18 12:35:04,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:04,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:04,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105227616] [2019-12-18 12:35:04,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:04,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:04,981 INFO L87 Difference]: Start difference. First operand 10198 states and 32203 transitions. Second operand 7 states. [2019-12-18 12:35:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:06,281 INFO L93 Difference]: Finished difference Result 23501 states and 70449 transitions. [2019-12-18 12:35:06,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:35:06,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:35:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:06,313 INFO L225 Difference]: With dead ends: 23501 [2019-12-18 12:35:06,313 INFO L226 Difference]: Without dead ends: 23333 [2019-12-18 12:35:06,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:35:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23333 states. [2019-12-18 12:35:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23333 to 15575. [2019-12-18 12:35:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15575 states. [2019-12-18 12:35:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15575 states to 15575 states and 47746 transitions. [2019-12-18 12:35:06,625 INFO L78 Accepts]: Start accepts. Automaton has 15575 states and 47746 transitions. Word has length 65 [2019-12-18 12:35:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:06,625 INFO L462 AbstractCegarLoop]: Abstraction has 15575 states and 47746 transitions. [2019-12-18 12:35:06,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15575 states and 47746 transitions. [2019-12-18 12:35:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:06,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:06,642 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:35:06,642 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:35:06,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash 266345566, now seen corresponding path program 1 times [2019-12-18 12:35:06,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:06,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086852513] [2019-12-18 12:35:06,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:06,709 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:35:06,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086852513] [2019-12-18 12:35:06,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:06,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:06,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861640645] [2019-12-18 12:35:06,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:06,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:06,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:06,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:06,711 INFO L87 Difference]: Start difference. First operand 15575 states and 47746 transitions. Second operand 4 states. [2019-12-18 12:35:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:06,832 INFO L93 Difference]: Finished difference Result 15387 states and 47001 transitions. [2019-12-18 12:35:06,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:35:06,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:35:06,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:06,852 INFO L225 Difference]: With dead ends: 15387 [2019-12-18 12:35:06,853 INFO L226 Difference]: Without dead ends: 15387 [2019-12-18 12:35:06,853 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:35:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15387 states. [2019-12-18 12:35:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15387 to 14373. [2019-12-18 12:35:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14373 states. [2019-12-18 12:35:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14373 states to 14373 states and 43885 transitions. [2019-12-18 12:35:07,092 INFO L78 Accepts]: Start accepts. Automaton has 14373 states and 43885 transitions. Word has length 65 [2019-12-18 12:35:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:07,092 INFO L462 AbstractCegarLoop]: Abstraction has 14373 states and 43885 transitions. [2019-12-18 12:35:07,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 14373 states and 43885 transitions. [2019-12-18 12:35:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:07,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:07,107 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:35:07,107 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:35:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash -547409899, now seen corresponding path program 1 times [2019-12-18 12:35:07,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:07,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174168265] [2019-12-18 12:35:07,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:07,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174168265] [2019-12-18 12:35:07,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:07,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:07,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402446326] [2019-12-18 12:35:07,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:07,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:07,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:07,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:07,228 INFO L87 Difference]: Start difference. First operand 14373 states and 43885 transitions. Second operand 7 states. [2019-12-18 12:35:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:08,235 INFO L93 Difference]: Finished difference Result 19110 states and 56991 transitions. [2019-12-18 12:35:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:35:08,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:35:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:08,268 INFO L225 Difference]: With dead ends: 19110 [2019-12-18 12:35:08,268 INFO L226 Difference]: Without dead ends: 18870 [2019-12-18 12:35:08,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:35:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18870 states. [2019-12-18 12:35:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18870 to 16407. [2019-12-18 12:35:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16407 states. [2019-12-18 12:35:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16407 states to 16407 states and 49508 transitions. [2019-12-18 12:35:08,577 INFO L78 Accepts]: Start accepts. Automaton has 16407 states and 49508 transitions. Word has length 65 [2019-12-18 12:35:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:08,577 INFO L462 AbstractCegarLoop]: Abstraction has 16407 states and 49508 transitions. [2019-12-18 12:35:08,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 16407 states and 49508 transitions. [2019-12-18 12:35:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:08,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:08,594 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:35:08,595 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:35:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -236370469, now seen corresponding path program 2 times [2019-12-18 12:35:08,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:08,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355343489] [2019-12-18 12:35:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:08,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355343489] [2019-12-18 12:35:08,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:08,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:08,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372346104] [2019-12-18 12:35:08,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:35:08,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:35:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:35:08,719 INFO L87 Difference]: Start difference. First operand 16407 states and 49508 transitions. Second operand 8 states. [2019-12-18 12:35:10,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:10,474 INFO L93 Difference]: Finished difference Result 29779 states and 88436 transitions. [2019-12-18 12:35:10,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:35:10,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:35:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:10,514 INFO L225 Difference]: With dead ends: 29779 [2019-12-18 12:35:10,514 INFO L226 Difference]: Without dead ends: 29779 [2019-12-18 12:35:10,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:35:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29779 states. [2019-12-18 12:35:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29779 to 17991. [2019-12-18 12:35:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17991 states. [2019-12-18 12:35:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17991 states to 17991 states and 54002 transitions. [2019-12-18 12:35:10,897 INFO L78 Accepts]: Start accepts. Automaton has 17991 states and 54002 transitions. Word has length 65 [2019-12-18 12:35:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:10,897 INFO L462 AbstractCegarLoop]: Abstraction has 17991 states and 54002 transitions. [2019-12-18 12:35:10,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:35:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 17991 states and 54002 transitions. [2019-12-18 12:35:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:10,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:10,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:10,916 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:35:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 371994719, now seen corresponding path program 3 times [2019-12-18 12:35:10,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:10,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107851309] [2019-12-18 12:35:10,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:10,975 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:35:10,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107851309] [2019-12-18 12:35:10,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:10,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:10,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856902219] [2019-12-18 12:35:10,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:10,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:10,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:10,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:10,977 INFO L87 Difference]: Start difference. First operand 17991 states and 54002 transitions. Second operand 3 states. [2019-12-18 12:35:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:11,048 INFO L93 Difference]: Finished difference Result 17990 states and 54000 transitions. [2019-12-18 12:35:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:11,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:35:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:11,072 INFO L225 Difference]: With dead ends: 17990 [2019-12-18 12:35:11,072 INFO L226 Difference]: Without dead ends: 17990 [2019-12-18 12:35:11,073 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:35:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17990 states. [2019-12-18 12:35:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17990 to 14395. [2019-12-18 12:35:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14395 states. [2019-12-18 12:35:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14395 states to 14395 states and 43961 transitions. [2019-12-18 12:35:11,333 INFO L78 Accepts]: Start accepts. Automaton has 14395 states and 43961 transitions. Word has length 65 [2019-12-18 12:35:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:11,333 INFO L462 AbstractCegarLoop]: Abstraction has 14395 states and 43961 transitions. [2019-12-18 12:35:11,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14395 states and 43961 transitions. [2019-12-18 12:35:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:11,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:11,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:11,349 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:35:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 889984155, now seen corresponding path program 1 times [2019-12-18 12:35:11,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:11,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751660860] [2019-12-18 12:35:11,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:11,419 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:35:11,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751660860] [2019-12-18 12:35:11,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:11,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:11,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618268805] [2019-12-18 12:35:11,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:11,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:11,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:11,421 INFO L87 Difference]: Start difference. First operand 14395 states and 43961 transitions. Second operand 3 states. [2019-12-18 12:35:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:11,480 INFO L93 Difference]: Finished difference Result 12450 states and 37319 transitions. [2019-12-18 12:35:11,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:11,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:35:11,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:11,501 INFO L225 Difference]: With dead ends: 12450 [2019-12-18 12:35:11,502 INFO L226 Difference]: Without dead ends: 12450 [2019-12-18 12:35:11,502 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:35:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12450 states. [2019-12-18 12:35:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12450 to 12192. [2019-12-18 12:35:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12192 states. [2019-12-18 12:35:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12192 states to 12192 states and 36571 transitions. [2019-12-18 12:35:11,854 INFO L78 Accepts]: Start accepts. Automaton has 12192 states and 36571 transitions. Word has length 66 [2019-12-18 12:35:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:11,854 INFO L462 AbstractCegarLoop]: Abstraction has 12192 states and 36571 transitions. [2019-12-18 12:35:11,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12192 states and 36571 transitions. [2019-12-18 12:35:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:11,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:11,880 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:35:11,880 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:35:11,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:11,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-18 12:35:11,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:11,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469107219] [2019-12-18 12:35:11,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:12,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469107219] [2019-12-18 12:35:12,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:12,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:12,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240892781] [2019-12-18 12:35:12,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:12,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:12,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:12,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:12,007 INFO L87 Difference]: Start difference. First operand 12192 states and 36571 transitions. Second operand 9 states. [2019-12-18 12:35:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:13,268 INFO L93 Difference]: Finished difference Result 23261 states and 68832 transitions. [2019-12-18 12:35:13,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:35:13,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:35:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:13,290 INFO L225 Difference]: With dead ends: 23261 [2019-12-18 12:35:13,290 INFO L226 Difference]: Without dead ends: 16732 [2019-12-18 12:35:13,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:35:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16732 states. [2019-12-18 12:35:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16732 to 12827. [2019-12-18 12:35:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12827 states. [2019-12-18 12:35:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12827 states to 12827 states and 38138 transitions. [2019-12-18 12:35:13,508 INFO L78 Accepts]: Start accepts. Automaton has 12827 states and 38138 transitions. Word has length 67 [2019-12-18 12:35:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:13,508 INFO L462 AbstractCegarLoop]: Abstraction has 12827 states and 38138 transitions. [2019-12-18 12:35:13,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 12827 states and 38138 transitions. [2019-12-18 12:35:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:13,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:13,521 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:35:13,521 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:35:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:13,522 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-18 12:35:13,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:13,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214429654] [2019-12-18 12:35:13,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:13,683 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:35:13,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214429654] [2019-12-18 12:35:13,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:13,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:13,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811268063] [2019-12-18 12:35:13,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:35:13,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:35:13,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:35:13,685 INFO L87 Difference]: Start difference. First operand 12827 states and 38138 transitions. Second operand 10 states. [2019-12-18 12:35:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:14,384 INFO L93 Difference]: Finished difference Result 18934 states and 55728 transitions. [2019-12-18 12:35:14,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:35:14,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:35:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:14,408 INFO L225 Difference]: With dead ends: 18934 [2019-12-18 12:35:14,408 INFO L226 Difference]: Without dead ends: 17915 [2019-12-18 12:35:14,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:35:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17915 states. [2019-12-18 12:35:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17915 to 14910. [2019-12-18 12:35:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14910 states. [2019-12-18 12:35:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14910 states to 14910 states and 44076 transitions. [2019-12-18 12:35:14,664 INFO L78 Accepts]: Start accepts. Automaton has 14910 states and 44076 transitions. Word has length 67 [2019-12-18 12:35:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:14,664 INFO L462 AbstractCegarLoop]: Abstraction has 14910 states and 44076 transitions. [2019-12-18 12:35:14,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:35:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 14910 states and 44076 transitions. [2019-12-18 12:35:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:14,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:14,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:14,680 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:35:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash 957967249, now seen corresponding path program 3 times [2019-12-18 12:35:14,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:14,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852982643] [2019-12-18 12:35:14,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:15,192 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:35:15,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852982643] [2019-12-18 12:35:15,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:15,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 12:35:15,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324319838] [2019-12-18 12:35:15,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 12:35:15,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:15,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 12:35:15,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:35:15,193 INFO L87 Difference]: Start difference. First operand 14910 states and 44076 transitions. Second operand 18 states. [2019-12-18 12:35:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:19,468 INFO L93 Difference]: Finished difference Result 16681 states and 48705 transitions. [2019-12-18 12:35:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 12:35:19,468 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 12:35:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:19,491 INFO L225 Difference]: With dead ends: 16681 [2019-12-18 12:35:19,492 INFO L226 Difference]: Without dead ends: 16566 [2019-12-18 12:35:19,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=404, Invalid=2902, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 12:35:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16566 states. [2019-12-18 12:35:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16566 to 13584. [2019-12-18 12:35:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13584 states. [2019-12-18 12:35:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13584 states to 13584 states and 39856 transitions. [2019-12-18 12:35:19,986 INFO L78 Accepts]: Start accepts. Automaton has 13584 states and 39856 transitions. Word has length 67 [2019-12-18 12:35:19,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:19,986 INFO L462 AbstractCegarLoop]: Abstraction has 13584 states and 39856 transitions. [2019-12-18 12:35:19,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 12:35:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 13584 states and 39856 transitions. [2019-12-18 12:35:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:20,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:20,000 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:35:20,000 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:35:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:20,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1827069457, now seen corresponding path program 4 times [2019-12-18 12:35:20,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:20,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73251986] [2019-12-18 12:35:20,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:20,468 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:35:20,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73251986] [2019-12-18 12:35:20,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:20,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 12:35:20,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224282190] [2019-12-18 12:35:20,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 12:35:20,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:20,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 12:35:20,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:35:20,470 INFO L87 Difference]: Start difference. First operand 13584 states and 39856 transitions. Second operand 18 states. [2019-12-18 12:35:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:24,701 INFO L93 Difference]: Finished difference Result 16761 states and 48831 transitions. [2019-12-18 12:35:24,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 12:35:24,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 12:35:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:24,724 INFO L225 Difference]: With dead ends: 16761 [2019-12-18 12:35:24,725 INFO L226 Difference]: Without dead ends: 16570 [2019-12-18 12:35:24,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=406, Invalid=2900, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 12:35:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16570 states. [2019-12-18 12:35:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16570 to 13488. [2019-12-18 12:35:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13488 states. [2019-12-18 12:35:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13488 states to 13488 states and 39564 transitions. [2019-12-18 12:35:24,944 INFO L78 Accepts]: Start accepts. Automaton has 13488 states and 39564 transitions. Word has length 67 [2019-12-18 12:35:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:24,944 INFO L462 AbstractCegarLoop]: Abstraction has 13488 states and 39564 transitions. [2019-12-18 12:35:24,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 12:35:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 13488 states and 39564 transitions. [2019-12-18 12:35:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:24,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:24,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:24,960 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:35:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash -674071045, now seen corresponding path program 5 times [2019-12-18 12:35:24,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:24,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128887486] [2019-12-18 12:35:24,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:25,126 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:35:25,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128887486] [2019-12-18 12:35:25,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:25,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:25,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409830863] [2019-12-18 12:35:25,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:35:25,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:25,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:35:25,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:35:25,128 INFO L87 Difference]: Start difference. First operand 13488 states and 39564 transitions. Second operand 10 states. [2019-12-18 12:35:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:25,688 INFO L93 Difference]: Finished difference Result 16800 states and 48566 transitions. [2019-12-18 12:35:25,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:35:25,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:35:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:25,707 INFO L225 Difference]: With dead ends: 16800 [2019-12-18 12:35:25,707 INFO L226 Difference]: Without dead ends: 14077 [2019-12-18 12:35:25,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:35:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14077 states. [2019-12-18 12:35:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14077 to 10981. [2019-12-18 12:35:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10981 states. [2019-12-18 12:35:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10981 states to 10981 states and 32378 transitions. [2019-12-18 12:35:25,896 INFO L78 Accepts]: Start accepts. Automaton has 10981 states and 32378 transitions. Word has length 67 [2019-12-18 12:35:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:25,896 INFO L462 AbstractCegarLoop]: Abstraction has 10981 states and 32378 transitions. [2019-12-18 12:35:25,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:35:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 10981 states and 32378 transitions. [2019-12-18 12:35:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:25,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:25,908 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:35:25,908 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:35:25,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:25,908 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 6 times [2019-12-18 12:35:25,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:25,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157710387] [2019-12-18 12:35:25,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:26,089 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:35:26,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157710387] [2019-12-18 12:35:26,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:26,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:35:26,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202627712] [2019-12-18 12:35:26,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:35:26,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:26,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:35:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:35:26,091 INFO L87 Difference]: Start difference. First operand 10981 states and 32378 transitions. Second operand 11 states. [2019-12-18 12:35:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:26,845 INFO L93 Difference]: Finished difference Result 17693 states and 52148 transitions. [2019-12-18 12:35:26,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:35:26,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:35:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:26,866 INFO L225 Difference]: With dead ends: 17693 [2019-12-18 12:35:26,866 INFO L226 Difference]: Without dead ends: 16674 [2019-12-18 12:35:26,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:35:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16674 states. [2019-12-18 12:35:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16674 to 14856. [2019-12-18 12:35:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14856 states. [2019-12-18 12:35:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14856 states to 14856 states and 43980 transitions. [2019-12-18 12:35:27,368 INFO L78 Accepts]: Start accepts. Automaton has 14856 states and 43980 transitions. Word has length 67 [2019-12-18 12:35:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:27,368 INFO L462 AbstractCegarLoop]: Abstraction has 14856 states and 43980 transitions. [2019-12-18 12:35:27,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:35:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14856 states and 43980 transitions. [2019-12-18 12:35:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:27,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:27,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:27,384 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 324937045, now seen corresponding path program 7 times [2019-12-18 12:35:27,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:27,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553003309] [2019-12-18 12:35:27,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:27,530 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:35:27,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553003309] [2019-12-18 12:35:27,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:27,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:35:27,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108139080] [2019-12-18 12:35:27,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:35:27,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:27,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:35:27,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:35:27,534 INFO L87 Difference]: Start difference. First operand 14856 states and 43980 transitions. Second operand 11 states. [2019-12-18 12:35:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:28,372 INFO L93 Difference]: Finished difference Result 17502 states and 50851 transitions. [2019-12-18 12:35:28,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:35:28,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:35:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:28,390 INFO L225 Difference]: With dead ends: 17502 [2019-12-18 12:35:28,391 INFO L226 Difference]: Without dead ends: 13290 [2019-12-18 12:35:28,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:35:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13290 states. [2019-12-18 12:35:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13290 to 11179. [2019-12-18 12:35:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11179 states. [2019-12-18 12:35:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11179 states to 11179 states and 32725 transitions. [2019-12-18 12:35:28,571 INFO L78 Accepts]: Start accepts. Automaton has 11179 states and 32725 transitions. Word has length 67 [2019-12-18 12:35:28,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:28,571 INFO L462 AbstractCegarLoop]: Abstraction has 11179 states and 32725 transitions. [2019-12-18 12:35:28,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:35:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 11179 states and 32725 transitions. [2019-12-18 12:35:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:28,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:28,581 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:35:28,581 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 8 times [2019-12-18 12:35:28,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:28,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696110408] [2019-12-18 12:35:28,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:28,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696110408] [2019-12-18 12:35:28,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:28,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:28,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669977560] [2019-12-18 12:35:28,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:35:28,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:28,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:35:28,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:35:28,740 INFO L87 Difference]: Start difference. First operand 11179 states and 32725 transitions. Second operand 10 states. [2019-12-18 12:35:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:29,843 INFO L93 Difference]: Finished difference Result 14145 states and 40356 transitions. [2019-12-18 12:35:29,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:35:29,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:35:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:29,861 INFO L225 Difference]: With dead ends: 14145 [2019-12-18 12:35:29,862 INFO L226 Difference]: Without dead ends: 13012 [2019-12-18 12:35:29,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:35:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13012 states. [2019-12-18 12:35:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13012 to 10599. [2019-12-18 12:35:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10599 states. [2019-12-18 12:35:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10599 states to 10599 states and 31140 transitions. [2019-12-18 12:35:30,047 INFO L78 Accepts]: Start accepts. Automaton has 10599 states and 31140 transitions. Word has length 67 [2019-12-18 12:35:30,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:30,047 INFO L462 AbstractCegarLoop]: Abstraction has 10599 states and 31140 transitions. [2019-12-18 12:35:30,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:35:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 10599 states and 31140 transitions. [2019-12-18 12:35:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:30,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:30,058 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:35:30,058 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:30,059 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 9 times [2019-12-18 12:35:30,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:30,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626444286] [2019-12-18 12:35:30,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:30,212 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:35:30,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626444286] [2019-12-18 12:35:30,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:30,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:30,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754822221] [2019-12-18 12:35:30,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:35:30,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:35:30,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:35:30,215 INFO L87 Difference]: Start difference. First operand 10599 states and 31140 transitions. Second operand 10 states. [2019-12-18 12:35:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:31,362 INFO L93 Difference]: Finished difference Result 13424 states and 38712 transitions. [2019-12-18 12:35:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:35:31,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:35:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:31,381 INFO L225 Difference]: With dead ends: 13424 [2019-12-18 12:35:31,381 INFO L226 Difference]: Without dead ends: 13053 [2019-12-18 12:35:31,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:35:31,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13053 states. [2019-12-18 12:35:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13053 to 10591. [2019-12-18 12:35:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10591 states. [2019-12-18 12:35:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10591 states to 10591 states and 31114 transitions. [2019-12-18 12:35:31,552 INFO L78 Accepts]: Start accepts. Automaton has 10591 states and 31114 transitions. Word has length 67 [2019-12-18 12:35:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:31,552 INFO L462 AbstractCegarLoop]: Abstraction has 10591 states and 31114 transitions. [2019-12-18 12:35:31,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:35:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 10591 states and 31114 transitions. [2019-12-18 12:35:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:31,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:31,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:31,562 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:31,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 10 times [2019-12-18 12:35:31,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:31,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429499145] [2019-12-18 12:35:31,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:31,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:35:31,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429499145] [2019-12-18 12:35:31,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:31,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:35:31,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534472023] [2019-12-18 12:35:31,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:35:31,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:31,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:35:31,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:35:31,754 INFO L87 Difference]: Start difference. First operand 10591 states and 31114 transitions. Second operand 12 states. [2019-12-18 12:35:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:32,504 INFO L93 Difference]: Finished difference Result 12777 states and 37026 transitions. [2019-12-18 12:35:32,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:32,505 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:35:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:32,522 INFO L225 Difference]: With dead ends: 12777 [2019-12-18 12:35:32,522 INFO L226 Difference]: Without dead ends: 12364 [2019-12-18 12:35:32,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:35:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12364 states. [2019-12-18 12:35:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12364 to 10337. [2019-12-18 12:35:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10337 states. [2019-12-18 12:35:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10337 states to 10337 states and 30470 transitions. [2019-12-18 12:35:32,696 INFO L78 Accepts]: Start accepts. Automaton has 10337 states and 30470 transitions. Word has length 67 [2019-12-18 12:35:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:32,696 INFO L462 AbstractCegarLoop]: Abstraction has 10337 states and 30470 transitions. [2019-12-18 12:35:32,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:35:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 10337 states and 30470 transitions. [2019-12-18 12:35:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:32,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:32,707 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:35:32,708 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 11 times [2019-12-18 12:35:32,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:32,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201273664] [2019-12-18 12:35:32,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:35:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:35:32,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:35:32,816 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:35:32,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= |v_ULTIMATE.start_main_~#t403~0.offset_22| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t403~0.base_29| 4)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t403~0.base_29|) (= v_~y~0_79 0) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= 0 v_~a$r_buff1_thd2~0_129) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t403~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t403~0.base_29|) |v_ULTIMATE.start_main_~#t403~0.offset_22| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t403~0.base_29|)) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t403~0.base_29| 1)) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t405~0.offset=|v_ULTIMATE.start_main_~#t405~0.offset_15|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t405~0.base=|v_ULTIMATE.start_main_~#t405~0.base_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t404~0.base=|v_ULTIMATE.start_main_~#t404~0.base_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ULTIMATE.start_main_~#t403~0.base=|v_ULTIMATE.start_main_~#t403~0.base_29|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, 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_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t404~0.offset=|v_ULTIMATE.start_main_~#t404~0.offset_22|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t403~0.offset=|v_ULTIMATE.start_main_~#t403~0.offset_22|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t405~0.offset, ~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, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t405~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t404~0.base, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t403~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~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_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t404~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t403~0.offset, ~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:35:32,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t404~0.base_12| 4)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t404~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t404~0.base_12|) |v_ULTIMATE.start_main_~#t404~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t404~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t404~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t404~0.base_12|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t404~0.base_12| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t404~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t404~0.offset=|v_ULTIMATE.start_main_~#t404~0.offset_10|, ULTIMATE.start_main_~#t404~0.base=|v_ULTIMATE.start_main_~#t404~0.base_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t404~0.offset, ULTIMATE.start_main_~#t404~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:35:32,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t405~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t405~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t405~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t405~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t405~0.offset_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t405~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t405~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t405~0.base_13|) |v_ULTIMATE.start_main_~#t405~0.offset_11| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t405~0.offset=|v_ULTIMATE.start_main_~#t405~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t405~0.base=|v_ULTIMATE.start_main_~#t405~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t405~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t405~0.base] because there is no mapped edge [2019-12-18 12:35:32,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~a$r_buff1_thd3~0_Out271170640 ~a$r_buff0_thd3~0_In271170640) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In271170640)) (= ~a$r_buff0_thd2~0_In271170640 ~a$r_buff1_thd2~0_Out271170640) (= 1 ~x~0_Out271170640) (= ~a$r_buff1_thd1~0_Out271170640 ~a$r_buff0_thd1~0_In271170640) (= ~__unbuffered_p0_EBX~0_Out271170640 ~y~0_In271170640) (= ~__unbuffered_p0_EAX~0_Out271170640 ~x~0_Out271170640) (= ~a$r_buff0_thd0~0_In271170640 ~a$r_buff1_thd0~0_Out271170640) (= ~a$r_buff0_thd1~0_Out271170640 1)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In271170640, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In271170640, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In271170640, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In271170640, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In271170640, ~y~0=~y~0_In271170640} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out271170640, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out271170640, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out271170640, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out271170640, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In271170640, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In271170640, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out271170640, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In271170640, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out271170640, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out271170640, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In271170640, ~y~0=~y~0_In271170640, ~x~0=~x~0_Out271170640} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:35:32,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-250588720 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-250588720 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-250588720| 0) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-250588720 |P0Thread1of1ForFork1_#t~ite5_Out-250588720|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-250588720, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-250588720} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-250588720|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-250588720, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-250588720} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:35:32,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-188805016 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-188805016 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-188805016 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-188805016 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-188805016|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-188805016 |P0Thread1of1ForFork1_#t~ite6_Out-188805016|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-188805016, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-188805016, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-188805016, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-188805016} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-188805016|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-188805016, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-188805016, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-188805016, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-188805016} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:35:32,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In168093587 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In168093587 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out168093587| ~a$w_buff1~0_In168093587) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out168093587| ~a~0_In168093587)))) InVars {~a~0=~a~0_In168093587, ~a$w_buff1~0=~a$w_buff1~0_In168093587, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In168093587, ~a$w_buff1_used~0=~a$w_buff1_used~0_In168093587} OutVars{~a~0=~a~0_In168093587, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out168093587|, ~a$w_buff1~0=~a$w_buff1~0_In168093587, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In168093587, ~a$w_buff1_used~0=~a$w_buff1_used~0_In168093587} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:35:32,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:35:32,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1652018496 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1652018496 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out1652018496)) (and (= ~a$r_buff0_thd1~0_In1652018496 ~a$r_buff0_thd1~0_Out1652018496) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1652018496, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1652018496} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1652018496|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1652018496, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1652018496} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:35:32,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In550793907 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In550793907 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In550793907 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In550793907 256)))) (or (and (= ~a$r_buff1_thd1~0_In550793907 |P0Thread1of1ForFork1_#t~ite8_Out550793907|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out550793907|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In550793907, ~a$w_buff0_used~0=~a$w_buff0_used~0_In550793907, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In550793907, ~a$w_buff1_used~0=~a$w_buff1_used~0_In550793907} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out550793907|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In550793907, ~a$w_buff0_used~0=~a$w_buff0_used~0_In550793907, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In550793907, ~a$w_buff1_used~0=~a$w_buff1_used~0_In550793907} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:35:32,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} 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:35:32,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1310108337 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1310108337 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1310108337| ~a$w_buff0_used~0_In1310108337)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1310108337|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1310108337, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1310108337} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1310108337, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1310108337, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1310108337|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:35:32,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-716184358 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-716184358| ~a$w_buff0~0_In-716184358) (= |P2Thread1of1ForFork0_#t~ite20_In-716184358| |P2Thread1of1ForFork0_#t~ite20_Out-716184358|)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-716184358| |P2Thread1of1ForFork0_#t~ite21_Out-716184358|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-716184358 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-716184358 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In-716184358 256) 0)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-716184358 256)) .cse1))) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-716184358| ~a$w_buff0~0_In-716184358)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-716184358, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-716184358, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-716184358, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-716184358, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-716184358, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-716184358|, ~weak$$choice2~0=~weak$$choice2~0_In-716184358} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-716184358|, ~a$w_buff0~0=~a$w_buff0~0_In-716184358, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-716184358, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-716184358, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-716184358, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-716184358|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-716184358, ~weak$$choice2~0=~weak$$choice2~0_In-716184358} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:35:32,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In113634940 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In113634940| |P2Thread1of1ForFork0_#t~ite23_Out113634940|) (= ~a$w_buff1~0_In113634940 |P2Thread1of1ForFork0_#t~ite24_Out113634940|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out113634940| |P2Thread1of1ForFork0_#t~ite23_Out113634940|) (= ~a$w_buff1~0_In113634940 |P2Thread1of1ForFork0_#t~ite23_Out113634940|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In113634940 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In113634940 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In113634940 256))) (= 0 (mod ~a$w_buff0_used~0_In113634940 256))))))) InVars {~a$w_buff1~0=~a$w_buff1~0_In113634940, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In113634940|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In113634940, ~a$w_buff0_used~0=~a$w_buff0_used~0_In113634940, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In113634940, ~a$w_buff1_used~0=~a$w_buff1_used~0_In113634940, ~weak$$choice2~0=~weak$$choice2~0_In113634940} OutVars{~a$w_buff1~0=~a$w_buff1~0_In113634940, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out113634940|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out113634940|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In113634940, ~a$w_buff0_used~0=~a$w_buff0_used~0_In113634940, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In113634940, ~a$w_buff1_used~0=~a$w_buff1_used~0_In113634940, ~weak$$choice2~0=~weak$$choice2~0_In113634940} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:35:32,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1509844971 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1509844971 256)))) (or (= (mod ~a$w_buff0_used~0_In1509844971 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In1509844971 256)) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In1509844971 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite26_Out1509844971| |P2Thread1of1ForFork0_#t~ite27_Out1509844971|) (= |P2Thread1of1ForFork0_#t~ite26_Out1509844971| ~a$w_buff0_used~0_In1509844971)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1509844971| ~a$w_buff0_used~0_In1509844971) (= |P2Thread1of1ForFork0_#t~ite26_In1509844971| |P2Thread1of1ForFork0_#t~ite26_Out1509844971|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1509844971|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1509844971, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1509844971, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1509844971, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1509844971, ~weak$$choice2~0=~weak$$choice2~0_In1509844971} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1509844971|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1509844971|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1509844971, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1509844971, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1509844971, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1509844971, ~weak$$choice2~0=~weak$$choice2~0_In1509844971} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:35:32,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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:35:32,834 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_16 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_16, ~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:35:32,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-53824395 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-53824395 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-53824395| ~a$w_buff1~0_In-53824395) (not .cse0) (not .cse1)) (and (= ~a~0_In-53824395 |P2Thread1of1ForFork0_#t~ite38_Out-53824395|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-53824395, ~a$w_buff1~0=~a$w_buff1~0_In-53824395, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-53824395, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-53824395} OutVars{~a~0=~a~0_In-53824395, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-53824395|, ~a$w_buff1~0=~a$w_buff1~0_In-53824395, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-53824395, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-53824395} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:35:32,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:35:32,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1277881569 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1277881569 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1277881569 |P2Thread1of1ForFork0_#t~ite40_Out-1277881569|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1277881569|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1277881569, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1277881569} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1277881569|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1277881569, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1277881569} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:35:32,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-2129185229 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-2129185229 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-2129185229 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-2129185229 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2129185229| ~a$w_buff1_used~0_In-2129185229) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2129185229| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2129185229, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2129185229, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2129185229, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2129185229} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2129185229, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2129185229, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2129185229, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2129185229, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2129185229|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:35:32,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-146647394 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-146647394 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-146647394| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-146647394| ~a$r_buff0_thd3~0_In-146647394)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-146647394, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-146647394} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-146647394, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-146647394, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-146647394|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:35:32,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In756296669 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In756296669 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In756296669 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In756296669 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out756296669| ~a$r_buff1_thd3~0_In756296669)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out756296669| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In756296669, ~a$w_buff0_used~0=~a$w_buff0_used~0_In756296669, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In756296669, ~a$w_buff1_used~0=~a$w_buff1_used~0_In756296669} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out756296669|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In756296669, ~a$w_buff0_used~0=~a$w_buff0_used~0_In756296669, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In756296669, ~a$w_buff1_used~0=~a$w_buff1_used~0_In756296669} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:35:32,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In320725437 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In320725437 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In320725437 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In320725437 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out320725437| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In320725437 |P1Thread1of1ForFork2_#t~ite12_Out320725437|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In320725437, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In320725437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In320725437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In320725437} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In320725437, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In320725437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In320725437, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out320725437|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In320725437} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:35:32,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-2072090229 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-2072090229 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-2072090229 |P1Thread1of1ForFork2_#t~ite13_Out-2072090229|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-2072090229| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2072090229, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2072090229} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2072090229, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2072090229, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2072090229|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:35:32,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In284412693 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In284412693 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In284412693 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In284412693 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In284412693 |P1Thread1of1ForFork2_#t~ite14_Out284412693|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out284412693|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In284412693, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In284412693, ~a$w_buff0_used~0=~a$w_buff0_used~0_In284412693, ~a$w_buff1_used~0=~a$w_buff1_used~0_In284412693} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In284412693, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In284412693, ~a$w_buff0_used~0=~a$w_buff0_used~0_In284412693, ~a$w_buff1_used~0=~a$w_buff1_used~0_In284412693, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out284412693|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:35:32,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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:35:32,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, 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:35:32,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~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:35:32,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-1058476948 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1058476948 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1058476948| ~a$w_buff1~0_In-1058476948)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1058476948| ~a~0_In-1058476948)))) InVars {~a~0=~a~0_In-1058476948, ~a$w_buff1~0=~a$w_buff1~0_In-1058476948, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1058476948, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1058476948} OutVars{~a~0=~a~0_In-1058476948, ~a$w_buff1~0=~a$w_buff1~0_In-1058476948, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1058476948|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1058476948, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1058476948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:35:32,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:35:32,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-333857464 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-333857464 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-333857464| ~a$w_buff0_used~0_In-333857464)) (and (= |ULTIMATE.start_main_#t~ite49_Out-333857464| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-333857464, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-333857464} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-333857464, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-333857464|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-333857464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:35:32,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1890162664 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1890162664 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1890162664 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1890162664 256) 0))) (or (and (= ~a$w_buff1_used~0_In1890162664 |ULTIMATE.start_main_#t~ite50_Out1890162664|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out1890162664| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1890162664, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1890162664, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1890162664, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1890162664} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1890162664|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1890162664, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1890162664, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1890162664, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1890162664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:35:32,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-972648766 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-972648766 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-972648766| ~a$r_buff0_thd0~0_In-972648766)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-972648766| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-972648766, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-972648766} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-972648766|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-972648766, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-972648766} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:35:32,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-510451768 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-510451768 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-510451768 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-510451768 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-510451768| ~a$r_buff1_thd0~0_In-510451768) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out-510451768| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-510451768, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-510451768, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-510451768, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-510451768} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-510451768|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-510451768, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-510451768, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-510451768, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-510451768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:35:32,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} 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:35:32,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:35:32 BasicIcfg [2019-12-18 12:35:32,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:35:32,947 INFO L168 Benchmark]: Toolchain (without parser) took 122318.09 ms. Allocated memory was 135.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 99.1 MB in the beginning and 940.4 MB in the end (delta: -841.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 12:35:32,947 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 135.8 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:35:32,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.74 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 98.7 MB in the beginning and 151.7 MB in the end (delta: -53.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:35:32,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.81 ms. Allocated memory is still 199.2 MB. Free memory was 151.7 MB in the beginning and 149.7 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:35:32,949 INFO L168 Benchmark]: Boogie Preprocessor took 40.67 ms. Allocated memory is still 199.2 MB. Free memory was 149.7 MB in the beginning and 147.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:35:32,949 INFO L168 Benchmark]: RCFGBuilder took 936.14 ms. Allocated memory is still 199.2 MB. Free memory was 146.6 MB in the beginning and 96.7 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:35:32,949 INFO L168 Benchmark]: TraceAbstraction took 120520.04 ms. Allocated memory was 199.2 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 95.7 MB in the beginning and 940.4 MB in the end (delta: -844.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:35:32,952 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60 ms. Allocated memory is still 135.8 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.74 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 98.7 MB in the beginning and 151.7 MB in the end (delta: -53.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.81 ms. Allocated memory is still 199.2 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.67 ms. Allocated memory is still 199.2 MB. Free memory was 149.7 MB in the beginning and 147.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 936.14 ms. Allocated memory is still 199.2 MB. Free memory was 146.6 MB in the beginning and 96.7 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120520.04 ms. Allocated memory was 199.2 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 95.7 MB in the beginning and 940.4 MB in the end (delta: -844.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 80759 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(&t403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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] [L839] FCALL, FORK 0 pthread_create(&t404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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_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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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_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] [L758] 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) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 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] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, 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$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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, 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] [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 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [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 [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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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_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: 120.2s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 47.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9722 SDtfs, 15612 SDslu, 35382 SDs, 0 SdLazy, 19797 SolverSat, 844 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 88 SyntacticMatches, 20 SemanticMatches, 566 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3367 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.0s AutomataMinimizationTime, 42 MinimizatonAttempts, 261984 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2102 NumberOfCodeBlocks, 2102 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1993 ConstructedInterpolants, 0 QuantifiedInterpolants, 485850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...