/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/mix032_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:19:57,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:19:57,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:19:57,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:19:57,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:19:57,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:19:57,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:19:57,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:19:57,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:19:57,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:19:57,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:19:57,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:19:57,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:19:57,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:19:57,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:19:57,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:19:57,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:19:57,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:19:57,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:19:57,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:19:57,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:19:57,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:19:57,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:19:57,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:19:57,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:19:57,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:19:57,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:19:57,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:19:57,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:19:57,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:19:57,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:19:57,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:19:57,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:19:57,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:19:57,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:19:57,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:19:57,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:19:57,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:19:57,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:19:57,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:19:57,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:19:57,354 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-26 22:19:57,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:19:57,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:19:57,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:19:57,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:19:57,377 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:19:57,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:19:57,377 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:19:57,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:19:57,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:19:57,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:19:57,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:19:57,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:19:57,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:19:57,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:19:57,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:19:57,383 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:19:57,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:19:57,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:19:57,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:19:57,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:19:57,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:19:57,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:19:57,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:19:57,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:19:57,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:19:57,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:19:57,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:19:57,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:19:57,385 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:19:57,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:19:57,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:19:57,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:19:57,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:19:57,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:19:57,670 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:19:57,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2019-12-26 22:19:57,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b9bb2503/b60d75922e3544c49bdd795b68ad0232/FLAG4e7de8eca [2019-12-26 22:19:58,204 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:19:58,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2019-12-26 22:19:58,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b9bb2503/b60d75922e3544c49bdd795b68ad0232/FLAG4e7de8eca [2019-12-26 22:19:58,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b9bb2503/b60d75922e3544c49bdd795b68ad0232 [2019-12-26 22:19:58,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:19:58,551 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:19:58,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:58,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:19:58,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:19:58,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:58" (1/1) ... [2019-12-26 22:19:58,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:58, skipping insertion in model container [2019-12-26 22:19:58,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:58" (1/1) ... [2019-12-26 22:19:58,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:19:58,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:19:59,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:59,177 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:19:59,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:59,324 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:19:59,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59 WrapperNode [2019-12-26 22:19:59,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:59,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:59,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:19:59,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:19:59,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:59,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:19:59,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:19:59,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:19:59,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (1/1) ... [2019-12-26 22:19:59,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:19:59,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:19:59,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:19:59,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:19:59,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (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-26 22:19:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:19:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:19:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:19:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:19:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:19:59,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:19:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:19:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:19:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:19:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:19:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:19:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:19:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:19:59,526 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:20:00,506 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:20:00,508 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:20:00,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:20:00 BoogieIcfgContainer [2019-12-26 22:20:00,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:20:00,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:20:00,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:20:00,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:20:00,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:19:58" (1/3) ... [2019-12-26 22:20:00,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515eae53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:20:00, skipping insertion in model container [2019-12-26 22:20:00,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:59" (2/3) ... [2019-12-26 22:20:00,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515eae53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:20:00, skipping insertion in model container [2019-12-26 22:20:00,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:20:00" (3/3) ... [2019-12-26 22:20:00,526 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_tso.oepc.i [2019-12-26 22:20:00,537 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:20:00,537 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:20:00,550 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:20:00,551 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:20:00,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,624 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,626 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,626 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,679 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,680 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,720 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,720 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,727 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,728 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:20:00,763 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:20:00,789 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:20:00,789 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:20:00,790 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:20:00,790 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:20:00,790 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:20:00,790 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:20:00,790 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:20:00,790 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:20:00,812 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-26 22:20:00,814 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 22:20:00,985 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 22:20:00,985 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:20:01,002 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:20:01,025 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 22:20:01,104 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 22:20:01,104 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:20:01,115 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:20:01,139 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:20:01,141 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:20:05,789 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-26 22:20:06,628 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 22:20:06,783 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 22:20:06,830 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-26 22:20:06,830 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-26 22:20:06,834 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-26 22:20:30,222 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-26 22:20:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-26 22:20:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:20:30,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:30,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:20:30,229 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-26 22:20:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-26 22:20:30,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:30,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229773841] [2019-12-26 22:20:30,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:30,460 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-26 22:20:30,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229773841] [2019-12-26 22:20:30,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:30,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:20:30,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5230052] [2019-12-26 22:20:30,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:20:30,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:30,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:20:30,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:20:30,486 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-26 22:20:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:31,758 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-26 22:20:31,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:20:31,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:20:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:35,944 INFO L225 Difference]: With dead ends: 128376 [2019-12-26 22:20:35,945 INFO L226 Difference]: Without dead ends: 120914 [2019-12-26 22:20:35,946 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-26 22:20:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-26 22:20:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-26 22:20:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-26 22:20:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-26 22:20:44,514 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-26 22:20:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:44,515 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-26 22:20:44,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:20:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-26 22:20:44,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:20:44,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:44,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:20:44,521 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-26 22:20:44,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:44,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-26 22:20:44,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:44,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252865554] [2019-12-26 22:20:44,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:48,316 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-26 22:20:48,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252865554] [2019-12-26 22:20:48,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:48,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:20:48,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546177009] [2019-12-26 22:20:48,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:20:48,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:48,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:20:48,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:20:48,320 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-26 22:20:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:49,699 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-26 22:20:49,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:20:49,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:20:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:50,348 INFO L225 Difference]: With dead ends: 187704 [2019-12-26 22:20:50,348 INFO L226 Difference]: Without dead ends: 187655 [2019-12-26 22:20:50,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:20:57,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-26 22:21:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-26 22:21:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-26 22:21:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-26 22:21:06,435 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-26 22:21:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:06,435 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-26 22:21:06,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:21:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-26 22:21:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:21:06,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:06,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:06,442 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-26 22:21:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:06,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-26 22:21:06,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:06,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408649314] [2019-12-26 22:21:06,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:06,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408649314] [2019-12-26 22:21:06,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:06,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:06,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105151547] [2019-12-26 22:21:06,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:06,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:06,505 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-26 22:21:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:06,672 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-26 22:21:06,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:06,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:21:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:06,738 INFO L225 Difference]: With dead ends: 36261 [2019-12-26 22:21:06,738 INFO L226 Difference]: Without dead ends: 36261 [2019-12-26 22:21:06,738 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-26 22:21:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-26 22:21:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-26 22:21:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-26 22:21:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-26 22:21:12,773 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-26 22:21:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:12,774 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-26 22:21:12,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-26 22:21:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:21:12,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:12,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:12,778 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-26 22:21:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-26 22:21:12,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:12,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409709424] [2019-12-26 22:21:12,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:12,881 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-26 22:21:12,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409709424] [2019-12-26 22:21:12,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:12,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:12,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032995573] [2019-12-26 22:21:12,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:21:12,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:12,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:21:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:21:12,883 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-26 22:21:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:13,457 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-26 22:21:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:21:13,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 22:21:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:13,559 INFO L225 Difference]: With dead ends: 50300 [2019-12-26 22:21:13,559 INFO L226 Difference]: Without dead ends: 50300 [2019-12-26 22:21:13,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:21:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-26 22:21:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-26 22:21:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-26 22:21:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-26 22:21:14,440 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-26 22:21:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:14,441 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-26 22:21:14,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:21:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-26 22:21:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:21:14,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:14,451 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-26 22:21:14,452 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-26 22:21:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:14,452 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-26 22:21:14,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:14,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11127651] [2019-12-26 22:21:14,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:14,599 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-26 22:21:14,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11127651] [2019-12-26 22:21:14,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:14,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:21:14,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813598405] [2019-12-26 22:21:14,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:21:14,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:14,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:21:14,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:21:14,603 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-26 22:21:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:15,876 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-26 22:21:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:21:15,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 22:21:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:15,996 INFO L225 Difference]: With dead ends: 64122 [2019-12-26 22:21:15,996 INFO L226 Difference]: Without dead ends: 64115 [2019-12-26 22:21:15,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:21:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-26 22:21:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-26 22:21:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-26 22:21:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-26 22:21:16,864 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-26 22:21:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:16,865 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-26 22:21:16,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:21:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-26 22:21:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:21:16,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:16,879 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-26 22:21:16,879 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-26 22:21:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-26 22:21:16,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:16,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563244834] [2019-12-26 22:21:16,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:16,949 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-26 22:21:16,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563244834] [2019-12-26 22:21:16,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:16,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:16,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826880244] [2019-12-26 22:21:16,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:21:16,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:21:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:21:16,951 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-26 22:21:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:17,028 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-26 22:21:17,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:21:17,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:21:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:17,057 INFO L225 Difference]: With dead ends: 17024 [2019-12-26 22:21:17,057 INFO L226 Difference]: Without dead ends: 17024 [2019-12-26 22:21:17,058 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-26 22:21:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-26 22:21:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-26 22:21:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-26 22:21:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-26 22:21:17,328 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-26 22:21:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:17,329 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-26 22:21:17,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:21:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-26 22:21:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:21:17,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:17,342 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-26 22:21:17,342 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-26 22:21:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-26 22:21:17,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:17,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491357209] [2019-12-26 22:21:17,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:17,398 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-26 22:21:17,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491357209] [2019-12-26 22:21:17,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:17,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:17,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417024448] [2019-12-26 22:21:17,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:17,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:17,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:17,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:17,400 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-26 22:21:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:17,501 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-26 22:21:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:17,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:21:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:17,533 INFO L225 Difference]: With dead ends: 24375 [2019-12-26 22:21:17,533 INFO L226 Difference]: Without dead ends: 24375 [2019-12-26 22:21:17,533 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-26 22:21:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-26 22:21:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-26 22:21:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-26 22:21:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-26 22:21:18,084 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-26 22:21:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:18,084 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-26 22:21:18,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-26 22:21:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:21:18,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:18,097 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-26 22:21:18,097 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-26 22:21:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-26 22:21:18,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:18,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892036324] [2019-12-26 22:21:18,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:18,182 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-26 22:21:18,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892036324] [2019-12-26 22:21:18,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:18,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:21:18,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282743091] [2019-12-26 22:21:18,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:21:18,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:21:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:21:18,184 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-26 22:21:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:18,759 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-26 22:21:18,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:21:18,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:21:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:18,796 INFO L225 Difference]: With dead ends: 26038 [2019-12-26 22:21:18,797 INFO L226 Difference]: Without dead ends: 26038 [2019-12-26 22:21:18,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:21:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-26 22:21:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-26 22:21:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-26 22:21:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-26 22:21:19,138 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-26 22:21:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:19,138 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-26 22:21:19,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:21:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-26 22:21:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:21:19,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:19,159 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-26 22:21:19,160 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-26 22:21:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-26 22:21:19,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:19,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994060530] [2019-12-26 22:21:19,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:19,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994060530] [2019-12-26 22:21:19,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:19,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:21:19,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187623188] [2019-12-26 22:21:19,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:21:19,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:21:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:21:19,253 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-26 22:21:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:20,474 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-26 22:21:20,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:21:20,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:21:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:20,516 INFO L225 Difference]: With dead ends: 28794 [2019-12-26 22:21:20,516 INFO L226 Difference]: Without dead ends: 28794 [2019-12-26 22:21:20,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:21:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-26 22:21:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-26 22:21:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-26 22:21:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-26 22:21:20,865 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-26 22:21:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:20,865 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-26 22:21:20,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:21:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-26 22:21:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:21:20,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:20,890 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-26 22:21:20,890 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-26 22:21:20,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:20,890 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-26 22:21:20,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:20,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962734618] [2019-12-26 22:21:20,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:20,953 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-26 22:21:20,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962734618] [2019-12-26 22:21:20,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:20,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:20,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638086714] [2019-12-26 22:21:20,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:21:20,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:20,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:21:20,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:21:20,955 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-26 22:21:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:21,100 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-26 22:21:21,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:21:21,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-26 22:21:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:21,129 INFO L225 Difference]: With dead ends: 33180 [2019-12-26 22:21:21,129 INFO L226 Difference]: Without dead ends: 16657 [2019-12-26 22:21:21,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-26 22:21:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-26 22:21:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-26 22:21:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-26 22:21:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-26 22:21:21,385 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-26 22:21:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:21,385 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-26 22:21:21,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:21:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-26 22:21:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:21:21,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:21,406 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-26 22:21:21,406 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-26 22:21:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-26 22:21:21,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:21,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421824180] [2019-12-26 22:21:21,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:21,466 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-26 22:21:21,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421824180] [2019-12-26 22:21:21,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:21,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:21:21,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546962537] [2019-12-26 22:21:21,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:21,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:21,468 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-26 22:21:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:21,746 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-26 22:21:21,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:21,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:21:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:21,778 INFO L225 Difference]: With dead ends: 16582 [2019-12-26 22:21:21,778 INFO L226 Difference]: Without dead ends: 16582 [2019-12-26 22:21:21,778 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-26 22:21:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-26 22:21:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-26 22:21:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-26 22:21:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-26 22:21:22,047 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-26 22:21:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:22,047 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-26 22:21:22,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-26 22:21:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:21:22,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:22,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:22,063 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-26 22:21:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-26 22:21:22,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:22,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830170707] [2019-12-26 22:21:22,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:22,125 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-26 22:21:22,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830170707] [2019-12-26 22:21:22,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:22,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:22,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423542873] [2019-12-26 22:21:22,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:21:22,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:22,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:21:22,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:21:22,128 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-26 22:21:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:22,237 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-26 22:21:22,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:21:22,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-26 22:21:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:22,258 INFO L225 Difference]: With dead ends: 26060 [2019-12-26 22:21:22,258 INFO L226 Difference]: Without dead ends: 11670 [2019-12-26 22:21:22,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-26 22:21:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-26 22:21:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-26 22:21:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-26 22:21:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-26 22:21:22,550 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-26 22:21:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:22,551 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-26 22:21:22,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:21:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-26 22:21:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:21:22,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:22,571 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-26 22:21:22,571 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-26 22:21:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:22,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-26 22:21:22,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:22,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155596813] [2019-12-26 22:21:22,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:22,667 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-26 22:21:22,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155596813] [2019-12-26 22:21:22,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:22,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:21:22,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284903364] [2019-12-26 22:21:22,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:21:22,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:21:22,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:21:22,674 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-26 22:21:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:22,760 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-26 22:21:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:21:22,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:21:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:22,775 INFO L225 Difference]: With dead ends: 10656 [2019-12-26 22:21:22,775 INFO L226 Difference]: Without dead ends: 7573 [2019-12-26 22:21:22,776 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-26 22:21:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-26 22:21:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-26 22:21:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-26 22:21:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-26 22:21:22,971 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-26 22:21:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:22,971 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-26 22:21:22,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:21:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-26 22:21:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:21:22,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:22,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 22:21:22,984 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-26 22:21:22,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:22,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-26 22:21:22,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:22,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402304833] [2019-12-26 22:21:22,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:23,068 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-26 22:21:23,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402304833] [2019-12-26 22:21:23,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:23,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:23,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760878279] [2019-12-26 22:21:23,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:23,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:23,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:23,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:23,070 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-26 22:21:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:23,144 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-26 22:21:23,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:23,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:21:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:23,161 INFO L225 Difference]: With dead ends: 10082 [2019-12-26 22:21:23,162 INFO L226 Difference]: Without dead ends: 10082 [2019-12-26 22:21:23,163 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-26 22:21:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-26 22:21:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-26 22:21:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-26 22:21:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-26 22:21:23,334 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-26 22:21:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:23,334 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-26 22:21:23,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-26 22:21:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:21:23,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:23,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:23,344 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-26 22:21:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-26 22:21:23,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:23,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745985287] [2019-12-26 22:21:23,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:23,428 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-26 22:21:23,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745985287] [2019-12-26 22:21:23,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:23,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:21:23,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097277101] [2019-12-26 22:21:23,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:21:23,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:21:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:21:23,430 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-26 22:21:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:23,680 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-26 22:21:23,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:21:23,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:21:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:23,700 INFO L225 Difference]: With dead ends: 15437 [2019-12-26 22:21:23,700 INFO L226 Difference]: Without dead ends: 11573 [2019-12-26 22:21:23,709 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-26 22:21:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-26 22:21:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-26 22:21:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-26 22:21:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-26 22:21:23,895 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-26 22:21:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:23,895 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-26 22:21:23,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:21:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-26 22:21:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:21:23,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:23,907 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-26 22:21:23,907 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-26 22:21:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-26 22:21:23,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:23,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156608838] [2019-12-26 22:21:23,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:24,000 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-26 22:21:24,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156608838] [2019-12-26 22:21:24,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:24,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:21:24,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304054655] [2019-12-26 22:21:24,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:21:24,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:24,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:21:24,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:21:24,002 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-26 22:21:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:24,272 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-26 22:21:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:21:24,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:21:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:24,291 INFO L225 Difference]: With dead ends: 17385 [2019-12-26 22:21:24,291 INFO L226 Difference]: Without dead ends: 13105 [2019-12-26 22:21:24,291 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-26 22:21:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-26 22:21:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-26 22:21:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-26 22:21:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-26 22:21:24,486 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-26 22:21:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:24,486 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-26 22:21:24,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:21:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-26 22:21:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:21:24,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:24,498 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-26 22:21:24,498 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-26 22:21:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-26 22:21:24,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:24,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85132387] [2019-12-26 22:21:24,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:24,604 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-26 22:21:24,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85132387] [2019-12-26 22:21:24,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:24,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:24,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092857254] [2019-12-26 22:21:24,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:21:24,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:24,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:21:24,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:21:24,606 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-26 22:21:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:25,757 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-26 22:21:25,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 22:21:25,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:21:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:25,796 INFO L225 Difference]: With dead ends: 24832 [2019-12-26 22:21:25,796 INFO L226 Difference]: Without dead ends: 22344 [2019-12-26 22:21:25,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:21:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-26 22:21:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-26 22:21:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-26 22:21:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-26 22:21:26,045 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-26 22:21:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:26,045 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-26 22:21:26,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:21:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-26 22:21:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:21:26,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:26,057 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-26 22:21:26,057 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-26 22:21:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:26,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-26 22:21:26,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:26,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445356755] [2019-12-26 22:21:26,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:26,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445356755] [2019-12-26 22:21:26,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:26,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:26,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483478777] [2019-12-26 22:21:26,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:21:26,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:26,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:21:26,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:21:26,201 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-26 22:21:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:27,526 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-26 22:21:27,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:21:27,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:21:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:27,564 INFO L225 Difference]: With dead ends: 28772 [2019-12-26 22:21:27,564 INFO L226 Difference]: Without dead ends: 26348 [2019-12-26 22:21:27,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:21:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-26 22:21:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-26 22:21:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-26 22:21:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-26 22:21:27,848 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-26 22:21:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:27,848 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-26 22:21:27,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:21:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-26 22:21:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:21:27,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:27,860 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-26 22:21:27,860 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-26 22:21:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-26 22:21:27,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:27,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175024482] [2019-12-26 22:21:27,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:27,926 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-26 22:21:27,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175024482] [2019-12-26 22:21:27,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:27,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:27,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874301498] [2019-12-26 22:21:27,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:27,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:27,928 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-26 22:21:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:28,028 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-26 22:21:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:28,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:21:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:28,050 INFO L225 Difference]: With dead ends: 12322 [2019-12-26 22:21:28,050 INFO L226 Difference]: Without dead ends: 12322 [2019-12-26 22:21:28,051 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-26 22:21:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-26 22:21:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-26 22:21:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-26 22:21:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-26 22:21:28,250 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-26 22:21:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:28,250 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-26 22:21:28,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-26 22:21:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:28,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:28,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 22:21:28,263 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-26 22:21:28,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:28,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-26 22:21:28,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:28,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499089298] [2019-12-26 22:21:28,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:28,358 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-26 22:21:28,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499089298] [2019-12-26 22:21:28,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:28,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:21:28,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068729810] [2019-12-26 22:21:28,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:21:28,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:21:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:21:28,360 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-26 22:21:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:29,147 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-26 22:21:29,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:21:29,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 22:21:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:29,181 INFO L225 Difference]: With dead ends: 29477 [2019-12-26 22:21:29,181 INFO L226 Difference]: Without dead ends: 26544 [2019-12-26 22:21:29,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:21:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-26 22:21:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-26 22:21:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-26 22:21:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-26 22:21:29,459 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-26 22:21:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:29,459 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-26 22:21:29,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:21:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-26 22:21:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:29,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:29,472 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-26 22:21:29,472 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-26 22:21:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:29,472 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-26 22:21:29,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:29,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099213031] [2019-12-26 22:21:29,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:29,590 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-26 22:21:29,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099213031] [2019-12-26 22:21:29,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:29,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:29,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879354602] [2019-12-26 22:21:29,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:21:29,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:29,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:21:29,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:21:29,592 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-26 22:21:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:30,739 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-26 22:21:30,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:21:30,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:21:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:30,779 INFO L225 Difference]: With dead ends: 32061 [2019-12-26 22:21:30,780 INFO L226 Difference]: Without dead ends: 29128 [2019-12-26 22:21:30,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:21:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-26 22:21:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-26 22:21:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-26 22:21:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-26 22:21:31,095 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-26 22:21:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:31,096 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-26 22:21:31,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:21:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-26 22:21:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:31,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:31,109 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-26 22:21:31,109 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-26 22:21:31,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:31,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-26 22:21:31,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:31,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042074214] [2019-12-26 22:21:31,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:31,228 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-26 22:21:31,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042074214] [2019-12-26 22:21:31,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:31,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:31,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241955001] [2019-12-26 22:21:31,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:21:31,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:31,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:21:31,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:21:31,234 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-26 22:21:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:32,495 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-26 22:21:32,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:21:32,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:21:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:32,539 INFO L225 Difference]: With dead ends: 33909 [2019-12-26 22:21:32,539 INFO L226 Difference]: Without dead ends: 30991 [2019-12-26 22:21:32,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:21:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-26 22:21:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-26 22:21:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-26 22:21:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-26 22:21:32,872 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-26 22:21:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:32,872 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-26 22:21:32,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:21:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-26 22:21:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:32,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:32,885 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-26 22:21:32,886 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-26 22:21:32,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:32,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-26 22:21:32,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:32,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238947969] [2019-12-26 22:21:32,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:32,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238947969] [2019-12-26 22:21:32,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:32,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:32,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952902471] [2019-12-26 22:21:32,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:21:32,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:21:32,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:21:32,967 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-26 22:21:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:33,072 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-26 22:21:33,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:21:33,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:21:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:33,093 INFO L225 Difference]: With dead ends: 11142 [2019-12-26 22:21:33,093 INFO L226 Difference]: Without dead ends: 11142 [2019-12-26 22:21:33,093 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-26 22:21:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-26 22:21:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-26 22:21:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-26 22:21:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-26 22:21:33,320 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-26 22:21:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:33,320 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-26 22:21:33,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:21:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-26 22:21:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:33,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:33,334 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-26 22:21:33,334 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-26 22:21:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-26 22:21:33,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:33,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356944268] [2019-12-26 22:21:33,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:33,413 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-26 22:21:33,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356944268] [2019-12-26 22:21:33,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:33,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:33,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710356635] [2019-12-26 22:21:33,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:33,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:33,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:33,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:33,416 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 3 states. [2019-12-26 22:21:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:33,466 INFO L93 Difference]: Finished difference Result 10673 states and 33421 transitions. [2019-12-26 22:21:33,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:33,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:21:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:33,488 INFO L225 Difference]: With dead ends: 10673 [2019-12-26 22:21:33,488 INFO L226 Difference]: Without dead ends: 10673 [2019-12-26 22:21:33,489 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-26 22:21:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-12-26 22:21:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10673. [2019-12-26 22:21:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10673 states. [2019-12-26 22:21:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10673 states to 10673 states and 33421 transitions. [2019-12-26 22:21:33,749 INFO L78 Accepts]: Start accepts. Automaton has 10673 states and 33421 transitions. Word has length 65 [2019-12-26 22:21:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:33,750 INFO L462 AbstractCegarLoop]: Abstraction has 10673 states and 33421 transitions. [2019-12-26 22:21:33,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 10673 states and 33421 transitions. [2019-12-26 22:21:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:21:33,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:33,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:33,768 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-26 22:21:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1101261716, now seen corresponding path program 1 times [2019-12-26 22:21:33,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:33,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235417635] [2019-12-26 22:21:33,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:33,840 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-26 22:21:33,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235417635] [2019-12-26 22:21:33,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:33,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:33,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997750416] [2019-12-26 22:21:33,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:33,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:33,842 INFO L87 Difference]: Start difference. First operand 10673 states and 33421 transitions. Second operand 3 states. [2019-12-26 22:21:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:33,887 INFO L93 Difference]: Finished difference Result 8641 states and 26214 transitions. [2019-12-26 22:21:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:33,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:21:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:33,903 INFO L225 Difference]: With dead ends: 8641 [2019-12-26 22:21:33,903 INFO L226 Difference]: Without dead ends: 8641 [2019-12-26 22:21:33,903 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-26 22:21:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8641 states. [2019-12-26 22:21:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8641 to 8368. [2019-12-26 22:21:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8368 states. [2019-12-26 22:21:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8368 states to 8368 states and 25353 transitions. [2019-12-26 22:21:34,110 INFO L78 Accepts]: Start accepts. Automaton has 8368 states and 25353 transitions. Word has length 66 [2019-12-26 22:21:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:34,110 INFO L462 AbstractCegarLoop]: Abstraction has 8368 states and 25353 transitions. [2019-12-26 22:21:34,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8368 states and 25353 transitions. [2019-12-26 22:21:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:34,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:34,118 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-26 22:21:34,118 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-26 22:21:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 1 times [2019-12-26 22:21:34,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:34,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572962198] [2019-12-26 22:21:34,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:34,287 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-26 22:21:34,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572962198] [2019-12-26 22:21:34,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:34,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:34,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804635443] [2019-12-26 22:21:34,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:21:34,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:34,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:21:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:21:34,289 INFO L87 Difference]: Start difference. First operand 8368 states and 25353 transitions. Second operand 10 states. [2019-12-26 22:21:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:35,743 INFO L93 Difference]: Finished difference Result 14716 states and 43783 transitions. [2019-12-26 22:21:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:21:35,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 22:21:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:35,758 INFO L225 Difference]: With dead ends: 14716 [2019-12-26 22:21:35,758 INFO L226 Difference]: Without dead ends: 11117 [2019-12-26 22:21:35,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:21:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11117 states. [2019-12-26 22:21:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11117 to 8666. [2019-12-26 22:21:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8666 states. [2019-12-26 22:21:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 26101 transitions. [2019-12-26 22:21:35,916 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 26101 transitions. Word has length 67 [2019-12-26 22:21:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:35,916 INFO L462 AbstractCegarLoop]: Abstraction has 8666 states and 26101 transitions. [2019-12-26 22:21:35,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:21:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 26101 transitions. [2019-12-26 22:21:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:35,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:35,925 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-26 22:21:35,925 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-26 22:21:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:35,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 2 times [2019-12-26 22:21:35,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:35,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249955375] [2019-12-26 22:21:35,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:36,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249955375] [2019-12-26 22:21:36,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:36,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:36,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501541465] [2019-12-26 22:21:36,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:21:36,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:36,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:21:36,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:21:36,083 INFO L87 Difference]: Start difference. First operand 8666 states and 26101 transitions. Second operand 10 states. [2019-12-26 22:21:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:37,410 INFO L93 Difference]: Finished difference Result 15216 states and 44769 transitions. [2019-12-26 22:21:37,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:21:37,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 22:21:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:37,427 INFO L225 Difference]: With dead ends: 15216 [2019-12-26 22:21:37,427 INFO L226 Difference]: Without dead ends: 12165 [2019-12-26 22:21:37,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:21:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-12-26 22:21:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 9002. [2019-12-26 22:21:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2019-12-26 22:21:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 26931 transitions. [2019-12-26 22:21:37,596 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 26931 transitions. Word has length 67 [2019-12-26 22:21:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:37,596 INFO L462 AbstractCegarLoop]: Abstraction has 9002 states and 26931 transitions. [2019-12-26 22:21:37,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:21:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 26931 transitions. [2019-12-26 22:21:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:37,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:37,605 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-26 22:21:37,605 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-26 22:21:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:37,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 3 times [2019-12-26 22:21:37,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:37,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035448111] [2019-12-26 22:21:37,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:37,759 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-26 22:21:37,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035448111] [2019-12-26 22:21:37,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:37,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:37,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877922455] [2019-12-26 22:21:37,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:37,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:37,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:37,761 INFO L87 Difference]: Start difference. First operand 9002 states and 26931 transitions. Second operand 11 states. [2019-12-26 22:21:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:39,039 INFO L93 Difference]: Finished difference Result 14588 states and 42742 transitions. [2019-12-26 22:21:39,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:21:39,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:39,056 INFO L225 Difference]: With dead ends: 14588 [2019-12-26 22:21:39,056 INFO L226 Difference]: Without dead ends: 11765 [2019-12-26 22:21:39,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:21:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11765 states. [2019-12-26 22:21:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11765 to 8714. [2019-12-26 22:21:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8714 states. [2019-12-26 22:21:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8714 states to 8714 states and 26091 transitions. [2019-12-26 22:21:39,220 INFO L78 Accepts]: Start accepts. Automaton has 8714 states and 26091 transitions. Word has length 67 [2019-12-26 22:21:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:39,220 INFO L462 AbstractCegarLoop]: Abstraction has 8714 states and 26091 transitions. [2019-12-26 22:21:39,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 8714 states and 26091 transitions. [2019-12-26 22:21:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:39,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:39,230 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-26 22:21:39,230 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-26 22:21:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 4 times [2019-12-26 22:21:39,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:39,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934256964] [2019-12-26 22:21:39,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:39,402 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-26 22:21:39,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934256964] [2019-12-26 22:21:39,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:39,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:39,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317254820] [2019-12-26 22:21:39,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:39,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:39,404 INFO L87 Difference]: Start difference. First operand 8714 states and 26091 transitions. Second operand 11 states. [2019-12-26 22:21:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:40,622 INFO L93 Difference]: Finished difference Result 10605 states and 31433 transitions. [2019-12-26 22:21:40,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:21:40,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:40,635 INFO L225 Difference]: With dead ends: 10605 [2019-12-26 22:21:40,635 INFO L226 Difference]: Without dead ends: 9442 [2019-12-26 22:21:40,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:21:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9442 states. [2019-12-26 22:21:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9442 to 8898. [2019-12-26 22:21:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8898 states. [2019-12-26 22:21:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 26560 transitions. [2019-12-26 22:21:40,783 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 26560 transitions. Word has length 67 [2019-12-26 22:21:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:40,783 INFO L462 AbstractCegarLoop]: Abstraction has 8898 states and 26560 transitions. [2019-12-26 22:21:40,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 26560 transitions. [2019-12-26 22:21:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:40,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:40,792 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-26 22:21:40,792 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-26 22:21:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2131583359, now seen corresponding path program 5 times [2019-12-26 22:21:40,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:40,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758957620] [2019-12-26 22:21:40,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:40,940 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-26 22:21:40,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758957620] [2019-12-26 22:21:40,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:40,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:40,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205566723] [2019-12-26 22:21:40,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:40,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:40,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:40,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:40,942 INFO L87 Difference]: Start difference. First operand 8898 states and 26560 transitions. Second operand 11 states. [2019-12-26 22:21:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:42,041 INFO L93 Difference]: Finished difference Result 12368 states and 36172 transitions. [2019-12-26 22:21:42,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:21:42,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:42,065 INFO L225 Difference]: With dead ends: 12368 [2019-12-26 22:21:42,065 INFO L226 Difference]: Without dead ends: 11273 [2019-12-26 22:21:42,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:21:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2019-12-26 22:21:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 8766. [2019-12-26 22:21:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8766 states. [2019-12-26 22:21:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 26209 transitions. [2019-12-26 22:21:42,427 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 26209 transitions. Word has length 67 [2019-12-26 22:21:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:42,427 INFO L462 AbstractCegarLoop]: Abstraction has 8766 states and 26209 transitions. [2019-12-26 22:21:42,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 26209 transitions. [2019-12-26 22:21:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:42,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:42,436 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-26 22:21:42,436 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-26 22:21:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash -421367111, now seen corresponding path program 6 times [2019-12-26 22:21:42,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:42,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111897125] [2019-12-26 22:21:42,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:42,589 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-26 22:21:42,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111897125] [2019-12-26 22:21:42,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:42,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:21:42,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132596052] [2019-12-26 22:21:42,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:21:42,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:21:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:21:42,591 INFO L87 Difference]: Start difference. First operand 8766 states and 26209 transitions. Second operand 12 states. [2019-12-26 22:21:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:44,005 INFO L93 Difference]: Finished difference Result 12376 states and 36256 transitions. [2019-12-26 22:21:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:21:44,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 22:21:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:44,022 INFO L225 Difference]: With dead ends: 12376 [2019-12-26 22:21:44,022 INFO L226 Difference]: Without dead ends: 11729 [2019-12-26 22:21:44,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:21:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11729 states. [2019-12-26 22:21:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11729 to 8754. [2019-12-26 22:21:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8754 states. [2019-12-26 22:21:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 26177 transitions. [2019-12-26 22:21:44,183 INFO L78 Accepts]: Start accepts. Automaton has 8754 states and 26177 transitions. Word has length 67 [2019-12-26 22:21:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:44,183 INFO L462 AbstractCegarLoop]: Abstraction has 8754 states and 26177 transitions. [2019-12-26 22:21:44,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:21:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 8754 states and 26177 transitions. [2019-12-26 22:21:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:44,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:44,192 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-26 22:21:44,192 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-26 22:21:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash 53405721, now seen corresponding path program 7 times [2019-12-26 22:21:44,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:44,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096690385] [2019-12-26 22:21:44,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:44,453 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-26 22:21:44,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096690385] [2019-12-26 22:21:44,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:44,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:44,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204729818] [2019-12-26 22:21:44,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:44,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:44,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:44,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:44,456 INFO L87 Difference]: Start difference. First operand 8754 states and 26177 transitions. Second operand 11 states. [2019-12-26 22:21:45,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:45,453 INFO L93 Difference]: Finished difference Result 13183 states and 39003 transitions. [2019-12-26 22:21:45,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:21:45,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:45,480 INFO L225 Difference]: With dead ends: 13183 [2019-12-26 22:21:45,480 INFO L226 Difference]: Without dead ends: 12164 [2019-12-26 22:21:45,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-26 22:21:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12164 states. [2019-12-26 22:21:45,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12164 to 10338. [2019-12-26 22:21:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10338 states. [2019-12-26 22:21:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10338 states to 10338 states and 30809 transitions. [2019-12-26 22:21:45,784 INFO L78 Accepts]: Start accepts. Automaton has 10338 states and 30809 transitions. Word has length 67 [2019-12-26 22:21:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:45,785 INFO L462 AbstractCegarLoop]: Abstraction has 10338 states and 30809 transitions. [2019-12-26 22:21:45,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10338 states and 30809 transitions. [2019-12-26 22:21:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:45,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:45,800 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-26 22:21:45,800 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-26 22:21:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash -374832785, now seen corresponding path program 8 times [2019-12-26 22:21:45,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:45,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261762329] [2019-12-26 22:21:45,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:45,982 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-26 22:21:45,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261762329] [2019-12-26 22:21:45,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:45,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:45,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112121609] [2019-12-26 22:21:45,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:45,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:45,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:45,984 INFO L87 Difference]: Start difference. First operand 10338 states and 30809 transitions. Second operand 11 states. [2019-12-26 22:21:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:46,763 INFO L93 Difference]: Finished difference Result 12614 states and 36935 transitions. [2019-12-26 22:21:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:21:46,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:46,778 INFO L225 Difference]: With dead ends: 12614 [2019-12-26 22:21:46,779 INFO L226 Difference]: Without dead ends: 10559 [2019-12-26 22:21:46,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:21:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-12-26 22:21:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 8416. [2019-12-26 22:21:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-12-26 22:21:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 25159 transitions. [2019-12-26 22:21:46,920 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 25159 transitions. Word has length 67 [2019-12-26 22:21:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:46,920 INFO L462 AbstractCegarLoop]: Abstraction has 8416 states and 25159 transitions. [2019-12-26 22:21:46,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 25159 transitions. [2019-12-26 22:21:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:46,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:46,929 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-26 22:21:46,929 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-26 22:21:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 9 times [2019-12-26 22:21:46,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:46,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057729800] [2019-12-26 22:21:46,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:47,121 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-26 22:21:47,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057729800] [2019-12-26 22:21:47,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:47,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:47,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626791803] [2019-12-26 22:21:47,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:47,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:47,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:47,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:47,124 INFO L87 Difference]: Start difference. First operand 8416 states and 25159 transitions. Second operand 11 states. [2019-12-26 22:21:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:47,875 INFO L93 Difference]: Finished difference Result 10608 states and 31112 transitions. [2019-12-26 22:21:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:21:47,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:47,890 INFO L225 Difference]: With dead ends: 10608 [2019-12-26 22:21:47,890 INFO L226 Difference]: Without dead ends: 10397 [2019-12-26 22:21:47,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:21:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10397 states. [2019-12-26 22:21:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10397 to 8240. [2019-12-26 22:21:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8240 states. [2019-12-26 22:21:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 24675 transitions. [2019-12-26 22:21:48,040 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 24675 transitions. Word has length 67 [2019-12-26 22:21:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:48,040 INFO L462 AbstractCegarLoop]: Abstraction has 8240 states and 24675 transitions. [2019-12-26 22:21:48,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 24675 transitions. [2019-12-26 22:21:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:48,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:48,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:21:48,050 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-26 22:21:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 10 times [2019-12-26 22:21:48,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:48,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140908106] [2019-12-26 22:21:48,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:21:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:21:48,174 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:21:48,174 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:21:48,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t867~0.base_25|)) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t867~0.base_25| 1)) (= |v_#NULL.offset_4| 0) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t867~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 |v_ULTIMATE.start_main_~#t867~0.offset_17|) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25|) |v_ULTIMATE.start_main_~#t867~0.offset_17| 0))) (= 0 v_~b$read_delayed_var~0.base_7) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t867~0.base_25| 4) |v_#length_25|) (= 0 v_~b$r_buff0_thd1~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_~#t867~0.base=|v_ULTIMATE.start_main_~#t867~0.base_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t867~0.offset=|v_ULTIMATE.start_main_~#t867~0.offset_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_21|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t867~0.base, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t867~0.offset, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-26 22:21:48,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t868~0.base_10|)) (= |v_ULTIMATE.start_main_~#t868~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10| 1) |v_#valid_27|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10|) |v_ULTIMATE.start_main_~#t868~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t868~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t868~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, #length] because there is no mapped edge [2019-12-26 22:21:48,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t869~0.base_13|) (= |v_ULTIMATE.start_main_~#t869~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t869~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13|) |v_ULTIMATE.start_main_~#t869~0.offset_11| 2)) |v_#memory_int_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t869~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_13|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-26 22:21:48,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1659210564)) (= ~__unbuffered_p0_EAX~0_Out1659210564 ~x~0_In1659210564) (= ~b$r_buff0_thd1~0_Out1659210564 1) (= ~b$r_buff1_thd3~0_Out1659210564 ~b$r_buff0_thd3~0_In1659210564) (= ~b$r_buff1_thd0~0_Out1659210564 ~b$r_buff0_thd0~0_In1659210564) (= ~b$r_buff0_thd2~0_In1659210564 ~b$r_buff1_thd2~0_Out1659210564) (= ~b$r_buff1_thd1~0_Out1659210564 ~b$r_buff0_thd1~0_In1659210564)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1659210564, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1659210564, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1659210564, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1659210564, ~x~0=~x~0_In1659210564, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1659210564} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1659210564, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1659210564, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1659210564, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1659210564, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1659210564, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1659210564, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1659210564, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1659210564, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1659210564, ~x~0=~x~0_In1659210564, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1659210564} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-26 22:21:48,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In775470744 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In775470744 256) 0))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In775470744 |P1Thread1of1ForFork0_#t~ite9_Out775470744|)) (and (= ~b~0_In775470744 |P1Thread1of1ForFork0_#t~ite9_Out775470744|) (or .cse0 .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In775470744, ~b~0=~b~0_In775470744, ~b$w_buff1~0=~b$w_buff1~0_In775470744, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In775470744} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In775470744, ~b~0=~b~0_In775470744, ~b$w_buff1~0=~b$w_buff1~0_In775470744, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out775470744|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In775470744} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 22:21:48,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 22:21:48,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-864114835 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-864114835 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-864114835|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out-864114835| ~b$w_buff0_used~0_In-864114835) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-864114835, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-864114835} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-864114835, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-864114835, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-864114835|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 22:21:48,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1861241557 256))) (.cse3 (= (mod ~b$r_buff1_thd2~0_In-1861241557 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-1861241557 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1861241557 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite12_Out-1861241557| ~b$w_buff1_used~0_In-1861241557) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out-1861241557|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1861241557, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1861241557, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1861241557, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1861241557} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1861241557, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1861241557, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1861241557, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1861241557|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1861241557} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 22:21:48,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-1924211761 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1924211761 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out-1924211761|)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd2~0_In-1924211761 |P1Thread1of1ForFork0_#t~ite13_Out-1924211761|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1924211761, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1924211761} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1924211761, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1924211761, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1924211761|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 22:21:48,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse2 (= (mod ~b$r_buff0_thd2~0_In1505640159 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In1505640159 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In1505640159 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In1505640159 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out1505640159|)) (and (= ~b$r_buff1_thd2~0_In1505640159 |P1Thread1of1ForFork0_#t~ite14_Out1505640159|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1505640159, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1505640159, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1505640159, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1505640159} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1505640159, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1505640159, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1505640159, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out1505640159|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1505640159} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 22:21:48,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 22:21:48,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1373980040 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out-1373980040| ~b$w_buff0~0_In-1373980040) (= |P2Thread1of1ForFork1_#t~ite20_In-1373980040| |P2Thread1of1ForFork1_#t~ite20_Out-1373980040|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite21_Out-1373980040| |P2Thread1of1ForFork1_#t~ite20_Out-1373980040|) (= |P2Thread1of1ForFork1_#t~ite20_Out-1373980040| ~b$w_buff0~0_In-1373980040) .cse0 (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1373980040 256) 0))) (or (and (= (mod ~b$w_buff1_used~0_In-1373980040 256) 0) .cse1) (= 0 (mod ~b$w_buff0_used~0_In-1373980040 256)) (and (= (mod ~b$r_buff1_thd3~0_In-1373980040 256) 0) .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1373980040, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1373980040, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1373980040|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1373980040, ~b$w_buff0~0=~b$w_buff0~0_In-1373980040, ~weak$$choice2~0=~weak$$choice2~0_In-1373980040, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1373980040} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1373980040, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1373980040, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1373980040|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1373980040|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1373980040, ~b$w_buff0~0=~b$w_buff0~0_In-1373980040, ~weak$$choice2~0=~weak$$choice2~0_In-1373980040, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1373980040} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 22:21:48,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2024294837 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out2024294837| ~b$w_buff0_used~0_In2024294837) (= |P2Thread1of1ForFork1_#t~ite26_In2024294837| |P2Thread1of1ForFork1_#t~ite26_Out2024294837|)) (and .cse0 (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In2024294837 256)))) (or (and (= 0 (mod ~b$r_buff1_thd3~0_In2024294837 256)) .cse1) (= (mod ~b$w_buff0_used~0_In2024294837 256) 0) (and (= (mod ~b$w_buff1_used~0_In2024294837 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite27_Out2024294837| |P2Thread1of1ForFork1_#t~ite26_Out2024294837|) (= ~b$w_buff0_used~0_In2024294837 |P2Thread1of1ForFork1_#t~ite26_Out2024294837|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2024294837, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2024294837, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In2024294837|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2024294837, ~weak$$choice2~0=~weak$$choice2~0_In2024294837, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2024294837} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2024294837, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out2024294837|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2024294837, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out2024294837|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2024294837, ~weak$$choice2~0=~weak$$choice2~0_In2024294837, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2024294837} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-26 22:21:48,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 22:21:48,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-26 22:21:48,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1223109633 256))) (.cse1 (= (mod ~b$r_buff1_thd3~0_In-1223109633 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-1223109633| ~b$w_buff1~0_In-1223109633) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-1223109633| ~b~0_In-1223109633)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1223109633, ~b~0=~b~0_In-1223109633, ~b$w_buff1~0=~b$w_buff1~0_In-1223109633, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1223109633} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1223109633|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1223109633, ~b~0=~b~0_In-1223109633, ~b$w_buff1~0=~b$w_buff1~0_In-1223109633, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1223109633} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-26 22:21:48,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-26 22:21:48,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1621069811 256))) (.cse0 (= (mod ~b$r_buff0_thd3~0_In-1621069811 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-1621069811 |P2Thread1of1ForFork1_#t~ite40_Out-1621069811|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-1621069811| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1621069811, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1621069811} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1621069811, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1621069811, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1621069811|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-26 22:21:48,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In2128588195 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In2128588195 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In2128588195 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In2128588195 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite41_Out2128588195| 0)) (and (= |P2Thread1of1ForFork1_#t~ite41_Out2128588195| ~b$w_buff1_used~0_In2128588195) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2128588195, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2128588195, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2128588195, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2128588195} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2128588195, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2128588195, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2128588195, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out2128588195|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2128588195} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-26 22:21:48,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In821910137 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In821910137 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out821910137|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out821910137| ~b$r_buff0_thd3~0_In821910137)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In821910137, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In821910137} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In821910137, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In821910137, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out821910137|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-26 22:21:48,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-496851787 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd3~0_In-496851787 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In-496851787 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In-496851787 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-496851787| ~b$r_buff1_thd3~0_In-496851787) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out-496851787| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-496851787, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-496851787, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-496851787, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-496851787} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-496851787, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-496851787, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-496851787|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-496851787, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-496851787} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-26 22:21:48,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 22:21:48,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In425976821 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In425976821 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out425976821| ~b$w_buff0_used~0_In425976821) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out425976821| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In425976821, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In425976821} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In425976821, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In425976821, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out425976821|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:21:48,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In481651089 256))) (.cse0 (= (mod ~b$r_buff1_thd1~0_In481651089 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In481651089 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In481651089 256) 0))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out481651089|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~b$w_buff1_used~0_In481651089 |P0Thread1of1ForFork2_#t~ite6_Out481651089|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In481651089, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In481651089, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In481651089, ~b$w_buff1_used~0=~b$w_buff1_used~0_In481651089} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In481651089, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In481651089, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In481651089, ~b$w_buff1_used~0=~b$w_buff1_used~0_In481651089, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out481651089|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:21:48,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In1915985519 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1915985519 256)))) (or (and (= ~b$r_buff0_thd1~0_Out1915985519 0) (not .cse0) (not .cse1)) (and (= ~b$r_buff0_thd1~0_Out1915985519 ~b$r_buff0_thd1~0_In1915985519) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1915985519, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1915985519} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1915985519, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1915985519, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1915985519|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:21:48,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd1~0_In1951197663 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In1951197663 256) 0)) (.cse2 (= (mod ~b$w_buff0_used~0_In1951197663 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd1~0_In1951197663 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite8_Out1951197663| ~b$r_buff1_thd1~0_In1951197663)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out1951197663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1951197663, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1951197663, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1951197663, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1951197663} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1951197663, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1951197663, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1951197663, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1951197663, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1951197663|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:21:48,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:21:48,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:21:48,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd0~0_In-1540672662 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In-1540672662 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1540672662| ~b$w_buff1~0_In-1540672662) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1540672662| ~b~0_In-1540672662) (or .cse0 .cse1)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1540672662, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1540672662, ~b~0=~b~0_In-1540672662, ~b$w_buff1~0=~b$w_buff1~0_In-1540672662} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1540672662, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1540672662, ~b~0=~b~0_In-1540672662, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1540672662|, ~b$w_buff1~0=~b$w_buff1~0_In-1540672662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 22:21:48,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:21:48,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In227551303 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In227551303 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out227551303|) (not .cse1)) (and (= ~b$w_buff0_used~0_In227551303 |ULTIMATE.start_main_#t~ite49_Out227551303|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In227551303, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In227551303} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In227551303, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out227551303|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In227551303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:21:48,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In283297777 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In283297777 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In283297777 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In283297777 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$w_buff1_used~0_In283297777 |ULTIMATE.start_main_#t~ite50_Out283297777|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out283297777|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In283297777, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In283297777, ~b$w_buff1_used~0=~b$w_buff1_used~0_In283297777, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In283297777} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out283297777|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In283297777, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In283297777, ~b$w_buff1_used~0=~b$w_buff1_used~0_In283297777, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In283297777} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:21:48,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In1358748790 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In1358748790 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1358748790| ~b$r_buff0_thd0~0_In1358748790)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1358748790|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1358748790, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1358748790} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1358748790, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1358748790|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1358748790} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:21:48,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In79179452 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In79179452 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In79179452 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In79179452 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out79179452|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~b$r_buff1_thd0~0_In79179452 |ULTIMATE.start_main_#t~ite52_Out79179452|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In79179452, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In79179452, ~b$w_buff1_used~0=~b$w_buff1_used~0_In79179452, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In79179452} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In79179452, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out79179452|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In79179452, ~b$w_buff1_used~0=~b$w_buff1_used~0_In79179452, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In79179452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:21:48,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:21:48,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:21:48 BasicIcfg [2019-12-26 22:21:48,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:21:48,307 INFO L168 Benchmark]: Toolchain (without parser) took 109755.95 ms. Allocated memory was 140.0 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 103.0 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-26 22:21:48,307 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:21:48,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.27 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 158.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:48,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.65 ms. Allocated memory is still 204.5 MB. Free memory was 158.2 MB in the beginning and 154.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:48,308 INFO L168 Benchmark]: Boogie Preprocessor took 45.62 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:48,309 INFO L168 Benchmark]: RCFGBuilder took 1066.33 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 101.8 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:48,309 INFO L168 Benchmark]: TraceAbstraction took 107794.30 ms. Allocated memory was 204.5 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 22:21:48,311 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.27 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 158.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.65 ms. Allocated memory is still 204.5 MB. Free memory was 158.2 MB in the beginning and 154.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.62 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1066.33 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 101.8 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107794.30 ms. Allocated memory was 204.5 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t867, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t868, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t869, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.3s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7504 SDtfs, 11593 SDslu, 27901 SDs, 0 SdLazy, 14525 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 75 SyntacticMatches, 12 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 174357 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1780 NumberOfCodeBlocks, 1780 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1679 ConstructedInterpolants, 0 QuantifiedInterpolants, 326789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...